Recognised as Number
98,370,949,113,369
- Positive
- Odd
- Composite
- Perfect square
- 14 digits
98,370,949,113,369 is an odd 14-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 value98,370,949,113,369
Digit count14
Digit sum72
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, 9,918,213²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 79^2 × 41,849^2
Distinct prime factors33, 79, 41,849
Number of divisors27
Sum of divisors σ(n)143,916,202,234,623
Aliquot sum45,545,253,121,254sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)64,748,950,909,344integers below n that share no factor with it
Carmichael function λ(n)5,395,745,909,112the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 64,748,950,909,344
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 79, 237, 711, 6,241, 18,723, 41,849, 56,169, 125,547, 376,641, 3,306,071, 9,918,213, 29,754,639, 261,179,609, 783,538,827, 1,751,338,801, 2,350,616,481, 5,254,016,403, 15,762,049,209, 138,355,765,279, 415,067,295,837, 1,245,201,887,511, 10,930,105,457,041, 32,790,316,371,123, 98,370,949,113,36927 in total
Arithmetic
Previous number98,370,949,113,368
Next number98,370,949,113,370
Double196,741,898,226,738
Square9,676,843,629,465,033,247,214,530,161
Cube951,920,292,252,133,768,273,866,292,730,156,858,822,409
Square root9,918,213exact
Cube root46,162.461013121≈
Negation-98,370,949,113,369
Reciprocal1.01656028 × 10^-14≈
Representations
Decimal98,370,949,113,369
Binary1011001011101111100010101111010011001100001100147 bits
Octal2627370536463031
Hexadecimal5977C57A6619
Base 36YVAZN8MC9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsninety-eight trillion, three hundred and seventy billion, nine hundred and forty-nine million, one hundred and thirteen thousand, three hundred and sixty-nine
Ordinalninety-eight trillion, three hundred and seventy billion, nine hundred and forty-nine million, one hundred and thirteen thousand, three hundred and sixty-ninth
Scientific notation9.83709491 × 10^13
Engineering notation98.370949 × 10^12
In other bases
Ternary110220022011121120200002201100base 3; the most digit-efficient integer base after e: 30 digits
Quinary100343202200433111434base 5; one hand: 21 digits
Septenary26502031552110552base 7: 17 digits
Nonary426264546602640base 9; each digit is two ternary digits: 15 digits
Duodecimalb048b479a4909base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 13 digits
Vigesimal9c2c61bj389base 20; hands and feet, and the Mayan and Yoruba systems: 11 digits
Sexagesimal35:8:25:51:0:42:36:9base 60; Babylonian, and still how an hour and a circle are divided: 8 digits
Balanced ternary1110T010T1TTT0TTT1T00010T01100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101011101000100011011010100011111011101001101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000010110010111011111000101011110100110011000011001
Bit length47 bitsto write the magnitude
Set bits26the population count, or Hamming weight
Zero bits21within that length
Bit parityeven26 set bits, so even; not the same as the number itself being odd
Highest set bitbit 46worth 70,368,744,177,664
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes659 77 c5 7a 66 19
Gray code11101011100110000100111110001110101010100010101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000010110010111011111000101011110100110011000011001
One's complement1111111111111111101001101000100000111010100001011001100111100110at 64 bits, every bit flipped
Bits reversed1001100001100110010111101010001111101110100110100000000000000000at 64 bits
Rotated left by 10000000000000000101100101110111110001010111101001100110000110010at 64 bits, wrapping
Shifted left by 1101100101110111110001010111101001100110000110010= 196,741,898,226,738, no wrap
Shifted right by 11011001011101111100010101111010011001100001100= 49,185,474,556,684, discarding the low bit
These bits as a double4.86017065 × 10^-310≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Distance to nearest prime20
Nearest square below98,370,949,113,369
Nearest square above98,370,968,949,796
Powers & multiples
98,370,949,113,369 to the power 29,676,843,629,465,033,247,214,530,161
98,370,949,113,369 to the power 3951920292252133768273866292730… (42 digits)
98,370,949,113,369 to the power 4936413026291179976723784722904… (56 digits)
98,370,949,113,369 to the power 5921158381583855330177213968449… (70 digits)
First ten multiples98,370,949,113,369, 196,741,898,226,738, 295,112,847,340,107, 393,483,796,453,476, 491,854,745,566,845, 590,225,694,680,214, 688,596,643,793,583, 786,967,592,906,952, 885,338,542,020,321, 983,709,491,133,690
Powers of twoBetween 2^46 (70,368,744,177,664) and 2^47 (140,737,488,355,328)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 3
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9Yes
Divisible by 10No, remainder 9
Divisible by 11No, remainder 9
Divisible by 12No, remainder 9
Divisible by 100No, remainder 69
Collatz (3n + 1) trajectory
Steps to reach 1587the total stopping time
Highest value reached332,001,953,257,6243× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps98,370,949,113,369 → 295,112,847,340,108 → 147,556,423,670,054 → 73,778,211,835,027 → 221,334,635,505,082 → 110,667,317,752,541 → 332,001,953,257,624 → 166,000,976,628,812 → 83,000,488,314,406 → 41,500,244,157,203 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage9.83709491 × 10^15%
98,370,949,113,369% as a decimal983,709,491,133.69
98,370,949,113,369% of 10098,370,949,113,369
98,370,949,113,369% of 1,000983,709,491,133,690
As a fraction of 10098,370,949,113,369/100
Read another way
As seconds3,117,187 years, 100 days and 36 minutes
As bytes89.468 TiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 98,370,949,113,369
Nearby primes
Also reads as
98370949113369 (identifier)
- 14 characters
- Checksum valid
98370949113369 matches the shape of Luhn (cards, IMEI), GTIN-14 (case/carton). The check digit is valid for Luhn (cards, IMEI). 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 validmod 10 with every second digit doubled
GTIN-14 (case/carton)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