Recognised as Number
467,170,883,001
- Positive
- Odd
- Composite
- Perfect square
- 12 digits
467,170,883,001 is an odd 12-digit integer and a composite number. It has 27 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value467,170,883,001
Digit count12
Digit sum45
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 683,499²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 73^2 × 3,121^2
Distinct prime factors33, 73, 3,121
Number of divisors27
Sum of divisors σ(n)684,392,169,357
Aliquot sum217,221,286,356sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)307,082,430,720integers below n that share no factor with it
Carmichael function λ(n)2,132,516,880the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 307,082,430,720
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 73, 219, 657, 3,121, 5,329, 9,363, 15,987, 28,089, 47,961, 227,833, 683,499, 2,050,497, 9,740,641, 16,631,809, 29,221,923, 49,895,427, 87,665,769, 149,686,281, 711,066,793, 2,133,200,379, 6,399,601,137, 51,907,875,889, 155,723,627,667, 467,170,883,00127 in total
Arithmetic
Previous number467,170,883,000
Next number467,170,883,002
Double934,341,766,002
Square218,248,633,923,934,030,766,001
Cube101,959,407,024,006,264,620,625,787,579,649,001
Square root683,499exact
Cube root7,759.34845803≈
Negation-467,170,883,001
Reciprocal2.14054436 × 10^-12≈
Representations
Decimal467,170,883,001
Binary11011001100010110001101111101011011100139 bits
Octal6630543372671
Hexadecimal6CC58DF5B9
Base 365YM5HCC9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour hundred and sixty-seven billion, one hundred and seventy million, eight hundred and eighty-three thousand and one
Ordinalfour hundred and sixty-seven billion, one hundred and seventy million, eight hundred and eighty-three thousand and first
Scientific notation4.67170883 × 10^11
Engineering notation467.170883 × 10^9
In other bases
Ternary1122122211221102202221100base 3; the most digit-efficient integer base after e: 25 digits
Quinary30123231221224001base 5; one hand: 17 digits
Septenary45515633662104base 7: 14 digits
Nonary1578757382840base 9; each digit is two ternary digits: 13 digits
Duodecimal7665a700309base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 11 digits
Vigesimali4jai07a1base 20; hands and feet, and the Mayan and Yoruba systems: 9 digits
Sexagesimal10:0:47:8:9:43:21base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternary1TT00T000TT0T1110T100T1100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011110111011010100100100000101011001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000000000110110011000101100011011111010110111001
Bit length39 bitsto write the magnitude
Set bits23the population count, or Hamming weight
Zero bits16within that length
Bit parityodd23 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 38worth 274,877,906,944
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes56c c5 8d f5 b9
Gray code101101010100111010010110000111101100101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000000000110110011000101100011011111010110111001
One's complement1111111111111111111111111001001100111010011100100000101001000110at 64 bits, every bit flipped
Bits reversed1001110110101111101100011010001100110110000000000000000000000000at 64 bits
Rotated left by 10000000000000000000000001101100110001011000110111110101101110010at 64 bits, wrapping
Shifted left by 11101100110001011000110111110101101110010= 934,341,766,002, no wrap
Shifted right by 111011001100010110001101111101011011100= 233,585,441,500, discarding the low bit
These bits as a double2.30813084 × 10^-312≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
467,170,883,001 to the power 2218,248,633,923,934,030,766,001
467,170,883,001 to the power 3101,959,407,024,006,264,620,625,787,579,649,001
467,170,883,001 to the power 4476324662096633682473734154607… (47 digits)
467,170,883,001 to the power 5222525012986837313430892642997… (59 digits)
First ten multiples467,170,883,001, 934,341,766,002, 1,401,512,649,003, 1,868,683,532,004, 2,335,854,415,005, 2,803,025,298,006, 3,270,196,181,007, 3,737,367,064,008, 4,204,537,947,009, 4,671,708,830,010
Powers of twoBetween 2^38 (274,877,906,944) and 2^39 (549,755,813,888)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 9
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1344the total stopping time
Highest value reached1,576,701,730,1323× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps467,170,883,001 → 1,401,512,649,004 → 700,756,324,502 → 350,378,162,251 → 1,051,134,486,754 → 525,567,243,377 → 1,576,701,730,132 → 788,350,865,066 → 394,175,432,533 → 1,182,526,297,600 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage46,717,088,300,100%
467,170,883,001% as a decimal4,671,708,830.01
467,170,883,001% of 100467,170,883,001
467,170,883,001% of 1,0004,671,708,830,010
As a fraction of 100467,170,883,001/100
Read another way
As seconds14,803 years, 274 days and 15 hours
As bytes435.087 GiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 467,170,883,001
Nearby primes
Also reads as
467170883001 (identifier)
- 12 characters
- Checksum fails
467170883001 matches the shape of Luhn (cards, IMEI), GTIN-12 (UPC-A). 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
Luhn (cards, IMEI)Check digit does not matchmod 10 with every second digit doubled
GTIN-12 (UPC-A)Check digit does not matchGS1 mod 10, weights 3 and 1 alternating from the right
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