Base | Representation |
---|---|
bin | 1011000000010111110100… |
… | …1011011000111000010001 |
3 | 1120211211212002200202101022 |
4 | 2300011331023120320101 |
5 | 3041230343342312241 |
6 | 41423044435445225 |
7 | 2356161426306260 |
oct | 260057513307021 |
9 | 46754762622338 |
10 | 12101023010321 |
11 | 394601901a783 |
12 | 1435314156815 |
13 | 69a177134b7b |
14 | 2db99a85a5d7 |
15 | 15eb96d8454b |
hex | b017d2d8e11 |
12101023010321 has 8 divisors (see below), whose sum is σ = 13830718546944. Its totient is φ = 10371571964640.
The previous prime is 12101023010257. The next prime is 12101023010369. The reversal of 12101023010321 is 12301032010121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12101023010321 - 26 = 12101023010257 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 12101023010321.
It is not an unprimeable number, because it can be changed into a prime (12101023019321) 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, 61016660 + ... + 61214661.
It is an arithmetic number, because the mean of its divisors is an integer number (1728839818368).
Almost surely, 212101023010321 is an apocalyptic number.
It is an amenable number.
12101023010321 is a deficient number, since it is larger than the sum of its proper divisors (1729695536623).
12101023010321 is a wasteful number, since it uses less digits than its factorization.
12101023010321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 122245471.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 12101023010321 its reverse (12301032010121), we get a palindrome (24402055020442).
The spelling of 12101023010321 in words is "twelve trillion, one hundred one billion, twenty-three million, ten thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •