Recognised as Number
3,463,723
- Positive
- Odd
- Composite
- 7 digits
3,463,723 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,463,723
Digit count7
Digit sum28
Digit product9,072
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 factorisation31 × 111,733
Distinct prime factors231, 111,733
Number of divisors4
Sum of divisors σ(n)3,575,488
Aliquot sum111,765sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,351,960integers below n that share no factor with it
Carmichael function λ(n)558,660the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,351,960
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 31, 111,733, 3,463,7234 in total
Arithmetic
Previous number3,463,722
Next number3,463,724
Double6,927,446
Half1,731,861.5
Square11,997,377,020,729
Cube41,555,590,726,370,514,067
Square root1,861.108003314≈irrational, shown to 9 decimal places
Cube root151.303062228≈
Negation-3,463,723
Reciprocal2.88706689 × 10^-7≈
Representations
Decimal3,463,723
Binary110100110110100010101122 bits
Octal15155053
Hexadecimal34DA2B
Base 36228MJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, four hundred and sixty-three thousand, seven hundred and twenty-three
Ordinalthree million, four hundred and sixty-three thousand, seven hundred and twenty-third
Scientific notation3.463723 × 10^6
Engineering notation3.463723 × 10^6
In other bases
Ternary20111222100001base 3; the most digit-efficient integer base after e: 14 digits
Quinary1341314343base 5; one hand: 10 digits
Septenary41304214base 7: 8 digits
Nonary6458301base 9; each digit is two ternary digits: 7 digits
Duodecimal11b0577base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal11cj63base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:2:8:43base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TTT00T100001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101010010111001111111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101001101101000101011
Bit length22 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits10within that length
Bit parityeven12 set bits, so even; not the same as the number itself being odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes334 da 2b
Gray code1011101011011100111110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101001101101000101011
64-bit0000000000000000000000000000000000000000001101001101101000101011
One's complement11111111110010110010010111010100at 32 bits, every bit flipped
Bits reversed11010100010110110010110000000000at 32 bits
Rotated left by 100000000011010011011010001010110at 32 bits, wrapping
Shifted left by 111010011011010001010110= 6,927,446, no wrap
Shifted right by 1110100110110100010101= 1,731,861, discarding the low bit
These bits as a double1.71130654 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,463,723 to the power 211,997,377,020,729
3,463,723 to the power 341,555,590,726,370,514,067
3,463,723 to the power 4143,937,055,377,516,256,095,691,441
3,463,723 to the power 5498,558,089,263,376,739,112,536,645,094,843
First ten multiples3,463,723, 6,927,446, 10,391,169, 13,854,892, 17,318,615, 20,782,338, 24,246,061, 27,709,784, 31,173,507, 34,637,230
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 1
Divisible by 10No, remainder 3
Divisible by 11No, remainder 10
Divisible by 12No, remainder 7
Divisible by 100No, remainder 23
Collatz (3n + 1) trajectory
Steps to reach 1221the total stopping time
Highest value reached15,586,7564× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,463,723 → 10,391,170 → 5,195,585 → 15,586,756 → 7,793,378 → 3,896,689 → 11,690,068 → 5,845,034 → 2,922,517 → 8,767,552 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage346,372,300%
3,463,723% as a decimal34,637.23
3,463,723% of 1003,463,723
3,463,723% of 1,00034,637,230
As a fraction of 1003,463,723/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 3,463,723
Nerdulate something else
Nothing in mind? Surprise me · today’s page