Base | Representation |
---|---|
bin | 10111000010001000111011… |
… | …110011111100000001011111 |
3 | 111021200101102200011110100201 |
4 | 113002020323303330001133 |
5 | 101234213201120130044 |
6 | 555241313202004331 |
7 | 30223556345405224 |
oct | 2702107363740137 |
9 | 437611380143321 |
10 | 101302102114399 |
11 | 2a306a86780a9a |
12 | b4410390466a7 |
13 | 446a9938bb754 |
14 | 1b0309563794b |
15 | baa1780287d4 |
hex | 5c223bcfc05f |
101302102114399 has 8 divisors (see below), whose sum is σ = 101955491525888. Its totient is φ = 100649742475680.
The previous prime is 101302102114363. The next prime is 101302102114439. The reversal of 101302102114399 is 993411201203101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101302102114399 - 227 = 101301967896671 is a prime.
It is a super-2 number, since 2×1013021021143992 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101302102114799) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 257245812 + ... + 257639305.
It is an arithmetic number, because the mean of its divisors is an integer number (12744436440736).
Almost surely, 2101302102114399 is an apocalyptic number.
101302102114399 is a deficient number, since it is larger than the sum of its proper divisors (653389411489).
101302102114399 is a wasteful number, since it uses less digits than its factorization.
101302102114399 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 514886385.
The product of its (nonzero) digits is 11664, while the sum is 37.
The spelling of 101302102114399 in words is "one hundred one trillion, three hundred two billion, one hundred two million, one hundred fourteen thousand, three hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •