Recognised as Number
83,495,934,787,321
- Positive
- Odd
- Composite
- Perfect square
- 14 digits
83,495,934,787,321 is an odd 14-digit integer and a composite number. It has 9 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value83,495,934,787,321
Digit count14
Digit sum73
Digit product1,097,349,120
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 9,137,611²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7^2 × 1,305,373^2
Distinct prime factors27, 1,305,373
Number of divisors9
Sum of divisors σ(n)97,127,998,546,671
Aliquot sum13,632,063,759,350sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)71,567,889,277,752integers below n that share no factor with it
Carmichael function λ(n)11,927,981,546,292the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 71,567,889,277,752
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 7, 49, 1,305,373, 9,137,611, 63,963,277, 1,703,998,669,129, 11,927,990,683,903, 83,495,934,787,3219 in total
Arithmetic
Previous number83,495,934,787,320
Next number83,495,934,787,322
Double166,991,869,574,642
Square6,971,571,126,008,561,125,502,357,041
Cube582,097,848,102,380,853,670,096,874,231,412,541,877,161
Square root9,137,611exact
Cube root43,707.413870129≈
Negation-83,495,934,787,321
Reciprocal1.1976631 × 10^-14≈
Representations
Decimal83,495,934,787,321
Binary1001011111100000110100110001000011111101111100147 bits
Octal2277015142077371
Hexadecimal4BF069887EF9
Base 36TLHI3RRI1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseighty-three trillion, four hundred and ninety-five billion, nine hundred and thirty-four million, seven hundred and eighty-seven thousand, three hundred and twenty-one
Ordinaleighty-three trillion, four hundred and ninety-five billion, nine hundred and thirty-four million, seven hundred and eighty-seven thousand, three hundred and twenty-first
Scientific notation8.34959348 × 10^13
Engineering notation83.495935 × 10^12
In other bases
Ternary101221122010121020220210220001base 3; the most digit-efficient integer base after e: 30 digits
Quinary41420444133301143241base 5; one hand: 20 digits
Septenary23405245046403100base 7: 17 digits
Nonary357563536823801base 9; each digit is two ternary digits: 15 digits
Duodecimal94460a3755761base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 13 digits
Vigesimal831b3jc8861base 20; hands and feet, and the Mayan and Yoruba systems: 11 digits
Sexagesimal29:49:36:27:33:38:42:1base 60; Babylonian, and still how an hour and a circle are divided: 8 digits
Balanced ternary11T00TT0T011TT11T10T1T110T0001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10111000011000110111110100110011000001100001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000010010111111000001101001100010000111111011111001
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
Bytes64b f0 69 88 7e f9
Gray code11011100000100001011101010011000100000110000101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000010010111111000001101001100010000111111011111001
One's complement1111111111111111101101000000111110010110011101111000000100000110at 64 bits, every bit flipped
Bits reversed1001111101111110000100011001011000001111110100100000000000000000at 64 bits
Rotated left by 10000000000000000100101111110000011010011000100001111110111110010at 64 bits, wrapping
Shifted left by 1100101111110000011010011000100001111110111110010= 166,991,869,574,642, no wrap
Shifted right by 11001011111100000110100110001000011111101111100= 41,747,967,393,660, discarding the low bit
These bits as a double4.12524729 × 10^-310≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Distance to nearest prime6
Nearest square below83,495,934,787,321
Nearest square above83,495,953,062,544
Powers & multiples
83,495,934,787,321 to the power 26,971,571,126,008,561,125,502,357,041
83,495,934,787,321 to the power 3582097848102380853670096874231… (42 digits)
83,495,934,787,321 to the power 4486028039649962768667166624768… (56 digits)
83,495,934,787,321 to the power 5405813655034227566403393494584… (70 digits)
First ten multiples83,495,934,787,321, 166,991,869,574,642, 250,487,804,361,963, 333,983,739,149,284, 417,479,673,936,605, 500,975,608,723,926, 584,471,543,511,247, 667,967,478,298,568, 751,463,413,085,889, 834,959,347,873,210
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 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7Yes
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 1
Divisible by 100No, remainder 21
Collatz (3n + 1) trajectory
Steps to reach 1305the total stopping time
Highest value reached317,023,627,395,6163× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps83,495,934,787,321 → 250,487,804,361,964 → 125,243,902,180,982 → 62,621,951,090,491 → 187,865,853,271,474 → 93,932,926,635,737 → 281,798,779,907,212 → 140,899,389,953,606 → 70,449,694,976,803 → 211,349,084,930,410 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage8.34959348 × 10^15%
83,495,934,787,321% as a decimal834,959,347,873.21
83,495,934,787,321% of 10083,495,934,787,321
83,495,934,787,321% of 1,000834,959,347,873,210
As a fraction of 10083,495,934,787,321/100
Read another way
As seconds2,645,826 years, 187 days and 14 hours
As bytes75.939 TiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 83,495,934,787,321
Nearby primes
Also reads as
83495934787321 (identifier)
- 14 characters
- Checksum fails
83495934787321 matches the shape of Luhn (cards, IMEI), GTIN-14 (case/carton). 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-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