Recognised as Number
136,492,646,402
- Positive
- Even
- Composite
- 12 digits
136,492,646,402 is an even 12-digit integer and a composite number. It has 16 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value136,492,646,402
Digit count12
Digit sum47
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 7 × 347 × 28,096,469
Distinct prime factors42, 7, 347, 28,096,469
Number of divisors16
Sum of divisors σ(n)234,661,717,440
Aliquot sum98,169,071,038sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)58,328,267,568integers below n that share no factor with it
Carmichael function λ(n)14,582,066,892the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 58,328,267,568
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 7, 14, 347, 694, 2,429, 4,858, 28,096,469, 56,192,938, 196,675,283, 393,350,566, 9,749,474,743, 19,498,949,486, 68,246,323,201, 136,492,646,40216 in total
Arithmetic
Previous number136,492,646,401
Next number136,492,646,403
Double272,985,292,804
Half68,246,323,201
Square18,630,242,521,821,403,545,604
Cube2,542,891,104,914,473,603,145,475,853,516,808
Square root369,449.112060105≈irrational, shown to 9 decimal places
Cube root5,148.765172284≈
Negation-136,492,646,402
Reciprocal7.32640202 × 10^-12≈
Representations
Decimal136,492,646,402
Binary111111100011110011000100000000000001037 bits
Octal1770746100002
Hexadecimal1FC7988002
Base 361QPC7402
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone hundred and thirty-six billion, four hundred and ninety-two million, six hundred and forty-six thousand, four hundred and two
Ordinalone hundred and thirty-six billion, four hundred and ninety-two million, six hundred and forty-six thousand, four hundred and second
Scientific notation1.36492646 × 10^11
Engineering notation136.492646 × 10^9
In other bases
Ternary111001022101222212010002base 3; the most digit-efficient integer base after e: 24 digits
Quinary4214014104141102base 5; one hand: 16 digits
Septenary12601262231420base 7: 14 digits
Nonary431271885102base 9; each digit is two ternary digits: 12 digits
Duodecimal22553140002base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 11 digits
Vigesimal56cdj0g02base 20; hands and feet, and the Mayan and Yoruba systems: 9 digits
Sexagesimal2:55:31:50:24:0:2base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternary11100110T11T0000TT01001Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary110000011011000111010011000000000000110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000000000001111111000111100110001000000000000010
Bit length37 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits22within that length
Bit parityodd15 set bits, so odd; not the same as the number itself being even
Highest set bitbit 36worth 68,719,476,736
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes51f c7 98 80 02
Gray code1000000100100010101001100000000000011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000000000001111111000111100110001000000000000010
One's complement1111111111111111111111111110000000111000011001110111111111111101at 64 bits, every bit flipped
Bits reversed0100000000000001000110011110001111111000000000000000000000000000at 64 bits
Rotated left by 10000000000000000000000000011111110001111001100010000000000000100at 64 bits, wrapping
Shifted left by 111111110001111001100010000000000000100= 272,985,292,804, no wrap
Shifted right by 1111111100011110011000100000000000001= 68,246,323,201, discarding the low bit
These bits as a double6.74363275 × 10^-313≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
136,492,646,402 to the power 218,630,242,521,821,403,545,604
136,492,646,402 to the power 32,542,891,104,914,473,603,145,475,853,516,808
136,492,646,402 to the power 4347085936421882329966098310640… (45 digits)
136,492,646,402 to the power 5473746779911390379593145453617… (56 digits)
First ten multiples136,492,646,402, 272,985,292,804, 409,477,939,206, 545,970,585,608, 682,463,232,010, 818,955,878,412, 955,448,524,814, 1,091,941,171,216, 1,228,433,817,618, 1,364,926,464,020
Powers of twoBetween 2^36 (68,719,476,736) and 2^37 (137,438,953,472)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6No, remainder 2
Divisible by 7Yes
Divisible by 8No, remainder 2
Divisible by 9No, remainder 2
Divisible by 10No, remainder 2
Divisible by 11No, remainder 2
Divisible by 12No, remainder 2
Divisible by 100No, remainder 2
Collatz (3n + 1) trajectory
Steps to reach 1275the total stopping time
Highest value reached204,738,969,6041× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps136,492,646,402 → 68,246,323,201 → 204,738,969,604 → 102,369,484,802 → 51,184,742,401 → 153,554,227,204 → 76,777,113,602 → 38,388,556,801 → 115,165,670,404 → 57,582,835,202 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage13,649,264,640,200%
136,492,646,402% as a decimal1,364,926,464.02
136,492,646,402% of 100136,492,646,402
136,492,646,402% of 1,0001,364,926,464,020
As a fraction of 100136,492,646,402/100
Read another way
As seconds4,325 years, 69 days and 18 hours
As bytes127.119 GiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 136,492,646,402
Nearby primes
Also reads as
136492646402 (identifier)
- 12 characters
- Checksum fails
136492646402 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