Recognised as Number
4,729,465
- Positive
- Odd
- Composite
- 7 digits
4,729,465 is an odd 7-digit integer and a composite number. It has 24 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value4,729,465
Digit count7
Digit sum37
Digit product60,480
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5 × 13^2 × 29 × 193
Distinct prime factors45, 13, 29, 193
Number of divisors24
Sum of divisors σ(n)6,390,360
Aliquot sum1,660,895sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,354,624integers below n that share no factor with it
Carmichael function λ(n)17,472the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,354,624
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 5, 13, 29, 65, 145, 169, 193, 377, 845, 965, 1,885, 2,509, 4,901, 5,597, 12,545, 24,505, 27,985, 32,617, 72,761, 163,085, 363,805, 945,893, 4,729,46524 in total
Arithmetic
Previous number4,729,464
Next number4,729,466
Double9,458,930
Half2,364,732.5
Square22,367,839,186,225
Cube105,787,912,556,879,619,625
Square root2,174.733316984≈irrational, shown to 9 decimal places
Cube root167.856181244≈
Negation-4,729,465
Reciprocal2.11440406 × 10^-7≈
Representations
Decimal4,729,465
Binary1001000001010100111100123 bits
Octal22025171
Hexadecimal482A79
Base 362TDA1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, seven hundred and twenty-nine thousand, four hundred and sixty-five
Ordinalfour million, seven hundred and twenty-nine thousand, four hundred and sixty-fifth
Scientific notation4.729465 × 10^6
Engineering notation4.729465 × 10^6
In other bases
Ternary22220021121101base 3; the most digit-efficient integer base after e: 14 digits
Quinary2202320330base 5; one hand: 10 digits
Septenary55125346base 7: 8 digits
Nonary8807541base 9; each digit is two ternary digits: 7 digits
Duodecimal1700b61base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal19b3d5base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal21:53:44:25base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1000T010TTT1101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110000111111110001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010010000010101001111001
Bit length23 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits13within that length
Bit parityeven10 set bits, so even; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes348 2a 79
Gray code11011000011111101000101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010010000010101001111001
64-bit0000000000000000000000000000000000000000010010000010101001111001
One's complement11111111101101111101010110000110at 32 bits, every bit flipped
Bits reversed10011110010101000001001000000000at 32 bits
Rotated left by 100000000100100000101010011110010at 32 bits, wrapping
Shifted left by 1100100000101010011110010= 9,458,930, no wrap
Shifted right by 11001000001010100111100= 2,364,732, discarding the low bit
These bits as a double2.33666618 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,729,465 to the power 222,367,839,186,225
4,729,465 to the power 3105,787,912,556,879,619,625
4,729,465 to the power 4500,320,229,860,822,670,229,750,625
4,729,465 to the power 52,366,247,015,918,715,690,058,147,539,665,625
First ten multiples4,729,465, 9,458,930, 14,188,395, 18,917,860, 23,647,325, 28,376,790, 33,106,255, 37,835,720, 42,565,185, 47,294,650
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5Yes
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 5
Divisible by 11No, remainder 4
Divisible by 12No, remainder 1
Divisible by 100No, remainder 65
Collatz (3n + 1) trajectory
Steps to reach 1123the total stopping time
Highest value reached26,935,7925× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,729,465 → 14,188,396 → 7,094,198 → 3,547,099 → 10,641,298 → 5,320,649 → 15,961,948 → 7,980,974 → 3,990,487 → 11,971,462 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage472,946,500%
4,729,465% as a decimal47,294.65
4,729,465% of 1004,729,465
4,729,465% of 1,00047,294,650
As a fraction of 1004,729,465/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 4,729,465
Nerdulate something else
Nothing in mind? Surprise me · today’s page