Base | Representation |
---|---|
bin | 10111010001000000000110… |
… | …100100111111011011101001 |
3 | 111102022000121110102121122120 |
4 | 113101000012210333123221 |
5 | 101402431321233021301 |
6 | 1001342420504341453 |
7 | 30360423342515163 |
oct | 2721000644773351 |
9 | 442260543377576 |
10 | 102323411220201 |
11 | 2a67012a082526 |
12 | b586b67474889 |
13 | 4513096837722 |
14 | 1b3a69db77933 |
15 | bc6a003e8e36 |
hex | 5d100693f6e9 |
102323411220201 has 8 divisors (see below), whose sum is σ = 136476707208000. Its totient is φ = 68192861356272.
The previous prime is 102323411220097. The next prime is 102323411220269. The reversal of 102323411220201 is 102022114323201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102323411220201 - 211 = 102323411218153 is a prime.
It is not an unprimeable number, because it can be changed into a prime (102323411220281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5686520470 + ... + 5686538463.
It is an arithmetic number, because the mean of its divisors is an integer number (17059588401000).
Almost surely, 2102323411220201 is an apocalyptic number.
It is an amenable number.
102323411220201 is a deficient number, since it is larger than the sum of its proper divisors (34153295987799).
102323411220201 is a wasteful number, since it uses less digits than its factorization.
102323411220201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11373061935.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 102323411220201 its reverse (102022114323201), we get a palindrome (204345525543402).
The spelling of 102323411220201 in words is "one hundred two trillion, three hundred twenty-three billion, four hundred eleven million, two hundred twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •