Base | Representation |
---|---|
bin | 10111010000101100001100… |
… | …001111001001111101111001 |
3 | 111102012222102110101022022010 |
4 | 113100230030033021331321 |
5 | 101402104030004314001 |
6 | 1001324523203120133 |
7 | 30356035463423316 |
oct | 2720541417117571 |
9 | 442188373338263 |
10 | 102302031323001 |
11 | 2a6620587452a4 |
12 | b58299b373049 |
13 | 451106a2cc493 |
14 | 1b396324d3d0d |
15 | bc619d4598d6 |
hex | 5d0b0c3c9f79 |
102302031323001 has 8 divisors (see below), whose sum is σ = 136402779982624. Its totient is φ = 68201318439360.
The previous prime is 102302031322963. The next prime is 102302031323017. The reversal of 102302031323001 is 100323130203201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102302031323001 - 210 = 102302031321977 is a prime.
It is a super-2 number, since 2×1023020313230012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102302031328001) 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, 1350895 + ... + 14367636.
It is an arithmetic number, because the mean of its divisors is an integer number (17050347497828).
Almost surely, 2102302031323001 is an apocalyptic number.
It is an amenable number.
102302031323001 is a deficient number, since it is larger than the sum of its proper divisors (34100748659623).
102302031323001 is a wasteful number, since it uses less digits than its factorization.
102302031323001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17887991.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 102302031323001 its reverse (100323130203201), we get a palindrome (202625161526202).
The spelling of 102302031323001 in words is "one hundred two trillion, three hundred two billion, thirty-one million, three hundred twenty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •