Recognised as Number
138,099,194,689
- Positive
- Odd
- Composite
- Perfect square
- 12 digits
138,099,194,689 is an odd 12-digit integer and a composite number. It has 3 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value138,099,194,689
Digit count12
Digit sum67
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 371,617²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation371,617^2
Distinct prime factors1371,617
Number of divisors3
Sum of divisors σ(n)138,099,566,307
Aliquot sum371,618sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)138,098,823,072integers below n that share no factor with it
Carmichael function λ(n)138,098,823,072the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 371,617, 138,099,194,6893 in total
Arithmetic
Previous number138,099,194,688
Next number138,099,194,690
Double276,198,389,378
Half69,049,597,344.5
Square19,071,387,573,750,325,806,721
Cube2,633,743,265,536,721,589,459,544,363,704,769
Square root371,617exact
Cube root5,168.887128183≈
Negation-138,099,194,689
Reciprocal7.24117184 × 10^-12≈
Representations
Decimal138,099,194,689
Binary1000000010011101011010011110110100000138 bits
Octal2004726475501
Hexadecimal20275A7B41
Base 361RFWP0LD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone hundred and thirty-eight billion, ninety-nine million, one hundred and ninety-four thousand, six hundred and eighty-nine
Ordinalone hundred and thirty-eight billion, ninety-nine million, one hundred and ninety-four thousand, six hundred and eighty-ninth
Scientific notation1.38099195 × 10^11
Engineering notation138.099195 × 10^9
In other bases
Ternary111012110100222222001111base 3; the most digit-efficient integer base after e: 24 digits
Quinary4230311343212224base 5; one hand: 16 digits
Septenary12656140533601base 7: 14 digits
Nonary435410888044base 9; each digit is two ternary digits: 12 digits
Duodecimal22921183541base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 11 digits
Vigesimal57hfjj6e9base 20; hands and feet, and the Mayan and Yoruba systems: 9 digits
Sexagesimal2:57:35:48:7:24:49base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternary1111TT11010100000T001111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary110000001111000101011111000111101000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000000000010000000100111010110100111101101000001
Bit length38 bitsto write the magnitude
Set bits17the population count, or Hamming weight
Zero bits21within that length
Bit parityodd17 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 37worth 137,438,953,472
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes520 27 5a 7b 41
Gray code11000000110100111101110100011011100001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000000000010000000100111010110100111101101000001
One's complement1111111111111111111111111101111111011000101001011000010010111110at 64 bits, every bit flipped
Bits reversed1000001011011110010110101110010000000100000000000000000000000000at 64 bits
Rotated left by 10000000000000000000000000100000001001110101101001111011010000010at 64 bits, wrapping
Shifted left by 1100000001001110101101001111011010000010= 276,198,389,378, no wrap
Shifted right by 11000000010011101011010011110110100000= 69,049,597,344, discarding the low bit
These bits as a double6.82300678 × 10^-313≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
138,099,194,689 to the power 219,071,387,573,750,325,806,721
138,099,194,689 to the power 32,633,743,265,536,721,589,459,544,363,704,769
138,099,194,689 to the power 4363717823988198338861563147372… (45 digits)
138,099,194,689 to the power 5502291385868056368367894037078… (56 digits)
First ten multiples138,099,194,689, 276,198,389,378, 414,297,584,067, 552,396,778,756, 690,495,973,445, 828,595,168,134, 966,694,362,823, 1,104,793,557,512, 1,242,892,752,201, 1,380,991,946,890
Powers of twoBetween 2^37 (137,438,953,472) and 2^38 (274,877,906,944)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 9
Divisible by 11No, remainder 5
Divisible by 12No, remainder 1
Divisible by 100No, remainder 89
Collatz (3n + 1) trajectory
Steps to reach 1288the total stopping time
Highest value reached414,297,584,0683× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps138,099,194,689 → 414,297,584,068 → 207,148,792,034 → 103,574,396,017 → 310,723,188,052 → 155,361,594,026 → 77,680,797,013 → 233,042,391,040 → 116,521,195,520 → 58,260,597,760 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage13,809,919,468,900%
138,099,194,689% as a decimal1,380,991,946.89
138,099,194,689% of 100138,099,194,689
138,099,194,689% of 1,0001,380,991,946,890
As a fraction of 100138,099,194,689/100
Read another way
As seconds4,376 years, 36 days and 7 hours
As bytes128.615 GiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 138,099,194,689
Nearby primes
Also reads as
138099194689 (identifier)
- 12 characters
- Checksum fails
138099194689 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