Recognised as Number
4,640,741,360,646
- Positive
- Even
- Composite
- 13 digits
4,640,741,360,646 is an even 13-digit integer and a composite number. It has 32 divisors and a digital root of 6.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value4,640,741,360,646
Digit count13
Digit sum51
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 3 × 409 × 1,217 × 1,553,897
Distinct prime factors52, 3, 409, 1,217, 1,553,897
Number of divisors32
Sum of divisors σ(n)9,311,826,998,880
Aliquot sum4,671,085,638,234sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)1,541,862,629,376integers below n that share no factor with it
Carmichael function λ(n)633,989,568the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,541,862,629,376
Möbius function μ(n)−15 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 6, 409, 818, 1,217, 1,227, 2,434, 2,454, 3,651, 7,302, 497,753, 995,506, 1,493,259, 1,553,897, 2,986,518, 3,107,794, 4,661,691, 9,323,382, 635,543,873, 1,271,087,746, 1,891,092,649, 1,906,631,619, 3,782,185,298, 3,813,263,238, 5,673,277,947, 11,346,555,894, 773,456,893,441, 1,546,913,786,882, 2,320,370,680,323, 4,640,741,360,64632 in total
Arithmetic
Previous number4,640,741,360,645
Next number4,640,741,360,647
Double9,281,482,721,292
Square21,536,480,376,410,487,437,537,316
Cube99,945,235,245,549,083,712,301,013,789,238,866,136
Square root2,154,238.00000046≈irrational, shown to 9 decimal places
Cube root16,679.990090231≈
Negation-4,640,741,360,646
Reciprocal2.15482812 × 10^-13≈
Representations
Decimal4,640,741,360,646
Binary100001110001000000110111101100001000000011043 bits
Octal103420157302006
Hexadecimal43881BD8406
Base 361N7XDL346
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour trillion, six hundred and forty billion, seven hundred and forty-one million, three hundred and sixty thousand, six hundred and forty-six
Ordinalfour trillion, six hundred and forty billion, seven hundred and forty-one million, three hundred and sixty thousand, six hundred and forty-sixth
Scientific notation4.64074136 × 10^12
Engineering notation4.640741 × 10^12
In other bases
Ternary121102122120020121022112120base 3; the most digit-efficient integer base after e: 27 digits
Quinary1102013214242020041base 5; one hand: 19 digits
Septenary656165616466206base 7: 15 digits
Nonary17378506538476base 9; each digit is two ternary digits: 14 digits
Duodecimal62b4a6a85406base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 12 digits
Vigesimal915bbda1c6base 20; hands and feet, and the Mayan and Yoruba systems: 10 digits
Sexagesimal1:39:28:1:53:42:24:6base 60; Babylonian, and still how an hour and a circle are divided: 8 digits
Balanced ternary1TT1110T00TT01T1TT1100TT0TT0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1000100100110000110110000101000010000011010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000001000011100010000001101111011000010000000110
Bit length43 bitsto write the magnitude
Set bits16the population count, or Hamming weight
Zero bits27within that length
Bit parityeven16 set bits, so even; not the same as the number itself being even
Highest set bitbit 42worth 4,398,046,511,104
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes604 38 81 bd 84 06
Gray code1100010010011000001011000110100011000000101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000001000011100010000001101111011000010000000110
One's complement1111111111111111111110111100011101111110010000100111101111111001at 64 bits, every bit flipped
Bits reversed0110000000100001101111011000000100011100001000000000000000000000at 64 bits
Rotated left by 10000000000000000000010000111000100000011011110110000100000001100at 64 bits, wrapping
Shifted left by 110000111000100000011011110110000100000001100= 9,281,482,721,292, no wrap
Shifted right by 1100001110001000000110111101100001000000011= 2,320,370,680,323, discarding the low bit
These bits as a double2.29283088 × 10^-311≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Distance to nearest prime7
Nearest square below4,640,741,360,644
Nearest square above4,640,745,669,121
Powers & multiples
4,640,741,360,646 to the power 221,536,480,376,410,487,437,537,316
4,640,741,360,646 to the power 399,945,235,245,549,083,712,301,013,789,238,866,136
4,640,741,360,646 to the power 4463819987003514010662402363539… (51 digits)
4,640,741,360,646 to the power 5215246859758149764622476169632… (64 digits)
First ten multiples4,640,741,360,646, 9,281,482,721,292, 13,922,224,081,938, 18,562,965,442,584, 23,203,706,803,230, 27,844,448,163,876, 32,485,189,524,522, 37,125,930,885,168, 41,766,672,245,814, 46,407,413,606,460
Powers of twoBetween 2^42 (4,398,046,511,104) and 2^43 (8,796,093,022,208)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 1
Divisible by 6Yes
Divisible by 7No, remainder 6
Divisible by 8No, remainder 6
Divisible by 9No, remainder 6
Divisible by 10No, remainder 6
Divisible by 11No, remainder 6
Divisible by 12No, remainder 6
Divisible by 100No, remainder 46
Collatz (3n + 1) trajectory
Steps to reach 1298the total stopping time
Highest value reached10,441,668,061,4562× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,640,741,360,646 → 2,320,370,680,323 → 6,961,112,040,970 → 3,480,556,020,485 → 10,441,668,061,456 → 5,220,834,030,728 → 2,610,417,015,364 → 1,305,208,507,682 → 652,604,253,841 → 1,957,812,761,524 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage464,074,136,064,600%
4,640,741,360,646% as a decimal46,407,413,606.46
4,640,741,360,646% of 1004,640,741,360,646
4,640,741,360,646% of 1,00046,407,413,606,460
As a fraction of 1004,640,741,360,646/100
Read another way
As seconds147,056 years, 80 days and 6 hours
As bytes4.221 TiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 4,640,741,360,646
Nearby primes
Also reads as
4640741360646 (identifier)
- 13 characters
- Checksum fails
4640741360646 matches the shape of ISBN-13 / EAN-13, Luhn (cards, IMEI). No check digit validates. A valid check digit only means the number is well-formed; it cannot tell you the thing it identifies exists.
Checksum tests
ISBN-13 / EAN-13Check digit does not matchmod 10 with alternating weights 1 and 3
Luhn (cards, IMEI)Check digit does not matchmod 10 with every second digit doubled
What this does not tell you
ExistenceNot checkedno network lookup is made, ever
Ownership or validity in useNot checked
Nerdulate something else
Nothing in mind? Surprise me · today’s page