Base | Representation |
---|---|
bin | 10111010000111100111011… |
… | …111011011100000111010010 |
3 | 111102021200211111221022002100 |
4 | 113100330323323130013102 |
5 | 101402402340400030002 |
6 | 1001341055253101230 |
7 | 30360243160105644 |
oct | 2720747373340722 |
9 | 442250744838070 |
10 | 102320011330002 |
11 | 2a669744a11714 |
12 | b586378927816 |
13 | 451297434c88b |
14 | 1b3a45a3d8894 |
15 | bc68a1bb411c |
hex | 5d0f3bedc1d2 |
102320011330002 has 48 divisors (see below), whose sum is σ = 221831160408000. Its totient is φ = 34085471529312.
The previous prime is 102320011330001. The next prime is 102320011330021. The reversal of 102320011330002 is 200033110023201.
102320011330002 is a `hidden beast` number, since 1 + 0 + 2 + 320 + 0 + 11 + 330 + 0 + 0 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (102320011330001) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1292548899 + ... + 1292628057.
It is an arithmetic number, because the mean of its divisors is an integer number (4621482508500).
Almost surely, 2102320011330002 is an apocalyptic number.
102320011330002 is an abundant number, since it is smaller than the sum of its proper divisors (119511149077998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102320011330002 is a wasteful number, since it uses less digits than its factorization.
102320011330002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 122895 (or 122892 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 102320011330002 its reverse (200033110023201), we get a palindrome (302353121353203).
The spelling of 102320011330002 in words is "one hundred two trillion, three hundred twenty billion, eleven million, three hundred thirty thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •