Base | Representation |
---|---|
bin | 1011000000011100101001… |
… | …1111001000011001000111 |
3 | 1120211222012111021020200110 |
4 | 2300013022133020121013 |
5 | 3041241022412000203 |
6 | 41423421251244103 |
7 | 2356235525641455 |
oct | 260071237103107 |
9 | 46758174236613 |
10 | 12102320031303 |
11 | 3946624172847 |
12 | 14356165a9633 |
13 | 69a322a68bc8 |
14 | 2dba80c039d5 |
15 | 15ec20b86d03 |
hex | b01ca7c8647 |
12102320031303 has 8 divisors (see below), whose sum is σ = 16212902665216. Its totient is φ = 8029975375800.
The previous prime is 12102320031301. The next prime is 12102320031337. The reversal of 12102320031303 is 30313002320121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12102320031303 - 21 = 12102320031301 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12102320031303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12102320031301) 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, 9559493863 + ... + 9559495128.
It is an arithmetic number, because the mean of its divisors is an integer number (2026612833152).
Almost surely, 212102320031303 is an apocalyptic number.
12102320031303 is a deficient number, since it is larger than the sum of its proper divisors (4110582633913).
12102320031303 is a wasteful number, since it uses less digits than its factorization.
12102320031303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19118989205.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 12102320031303 its reverse (30313002320121), we get a palindrome (42415322351424).
The spelling of 12102320031303 in words is "twelve trillion, one hundred two billion, three hundred twenty million, thirty-one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •