Recognised as Number
422,000,000,015
- Positive
- Odd
- Composite
- 12 digits
422,000,000,015 is an odd 12-digit integer and a composite number. It has 16 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value422,000,000,015
Digit count12
Digit sum14
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5 × 11 × 19,141 × 400,853
Distinct prime factors45, 11, 19,141, 400,853
Number of divisors16
Sum of divisors σ(n)552,466,603,296
Aliquot sum130,466,603,281sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)306,892,291,200integers below n that share no factor with it
Carmichael function λ(n)1,918,076,820the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 306,892,291,200
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 5, 11, 55, 19,141, 95,705, 210,551, 400,853, 1,052,755, 2,004,265, 4,409,383, 22,046,915, 7,672,727,273, 38,363,636,365, 84,400,000,003, 422,000,000,01516 in total
Arithmetic
Previous number422,000,000,014
Next number422,000,000,016
Double844,000,000,030
Square178,084,000,012,660,000,000,225
Cube75,151,448,008,013,780,000,284,850,000,003,375
Square root649,615.270768014≈irrational, shown to 9 decimal places
Cube root7,500.740667682≈
Negation-422,000,000,015
Reciprocal2.36966825 × 10^-12≈
Representations
Decimal422,000,000,015
Binary11000100100000100101000111111000000111139 bits
Octal6110112176017
Hexadecimal624128FC0F
Base 365DV3WJYN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour hundred and twenty-two billion and fifteen
Ordinalfour hundred and twenty-two billion and fifteenth
Scientific notation4.22 × 10^11
Engineering notation422 × 10^9
In other bases
Ternary1111100020220110011111012base 3; the most digit-efficient integer base after e: 25 digits
Quinary23403224000000030base 5; one hand: 17 digits
Septenary42326360546516base 7: 14 digits
Nonary1440226404435base 9; each digit is two ternary digits: 13 digits
Duodecimal69952b42b7bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 11 digits
Vigesimalg9df0000fbase 20; hands and feet, and the Mayan and Yoruba systems: 9 digits
Sexagesimal9:2:41:43:42:13:35base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternary11111001T10T01100111111TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010011001000001011110010000110000010011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000000000110001001000001001010001111110000001111
Bit length39 bitsto write the magnitude
Set bits17the population count, or Hamming weight
Zero bits22within that length
Bit parityodd17 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
Bytes562 41 28 fc 0f
Gray code101001101100001101111001000001000001000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000000000110001001000001001010001111110000001111
One's complement1111111111111111111111111001110110111110110101110000001111110000at 64 bits, every bit flipped
Bits reversed1111000000111111000101001000001001000110000000000000000000000000at 64 bits
Rotated left by 10000000000000000000000001100010010000010010100011111100000011110at 64 bits, wrapping
Shifted left by 11100010010000010010100011111100000011110= 844,000,000,030, no wrap
Shifted right by 111000100100000100101000111111000000111= 211,000,000,007, discarding the low bit
These bits as a double2.08495703 × 10^-312≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
422,000,000,015 to the power 2178,084,000,012,660,000,000,225
422,000,000,015 to the power 375,151,448,008,013,780,000,284,850,000,003,375
422,000,000,015 to the power 4317139110605090868802404134000… (47 digits)
422,000,000,015 to the power 5133832704680105433293690907580… (59 digits)
First ten multiples422,000,000,015, 844,000,000,030, 1,266,000,000,045, 1,688,000,000,060, 2,110,000,000,075, 2,532,000,000,090, 2,954,000,000,105, 3,376,000,000,120, 3,798,000,000,135, 4,220,000,000,150
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 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5Yes
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 5
Divisible by 10No, remainder 5
Divisible by 11Yes
Divisible by 12No, remainder 11
Divisible by 100No, remainder 15
Collatz (3n + 1) trajectory
Steps to reach 1243the total stopping time
Highest value reached4,272,750,000,16010× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps422,000,000,015 → 1,266,000,000,046 → 633,000,000,023 → 1,899,000,000,070 → 949,500,000,035 → 2,848,500,000,106 → 1,424,250,000,053 → 4,272,750,000,160 → 2,136,375,000,080 → 1,068,187,500,040 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage42,200,000,001,500%
422,000,000,015% as a decimal4,220,000,000.15
422,000,000,015% of 100422,000,000,015
422,000,000,015% of 1,0004,220,000,000,150
As a fraction of 100422,000,000,015/100
Read another way
As seconds13,372 years, 136 days and 6 hours
As bytes393.018 GiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 422,000,000,015
Nearby primes
Also reads as
422000000015 (identifier)
- 12 characters
- Checksum fails
422000000015 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