Base | Representation |
---|---|
bin | 1001001101110001110000… |
… | …1101000000011111101110 |
3 | 1022212122020110221120220012 |
4 | 2103130130031000133232 |
5 | 2312001423030220324 |
6 | 33314414223053222 |
7 | 2064014602444166 |
oct | 223343415003756 |
9 | 38778213846805 |
10 | 10132301023214 |
11 | 32570a2862a27 |
12 | 117785b141212 |
13 | 586619972b46 |
14 | 2705980515a6 |
15 | 12886eccb20e |
hex | 9371c3407ee |
10132301023214 has 4 divisors (see below), whose sum is σ = 15198451534824. Its totient is φ = 5066150511606.
The previous prime is 10132301023213. The next prime is 10132301023283. The reversal of 10132301023214 is 41232010323101.
10132301023214 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a self number, because there is not a number n which added to its sum of digits gives 10132301023214.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10132301023213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2533075255802 + ... + 2533075255805.
It is an arithmetic number, because the mean of its divisors is an integer number (3799612883706).
Almost surely, 210132301023214 is an apocalyptic number.
10132301023214 is a deficient number, since it is larger than the sum of its proper divisors (5066150511610).
10132301023214 is an equidigital number, since it uses as much as digits as its factorization.
10132301023214 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5066150511609.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 10132301023214 its reverse (41232010323101), we get a palindrome (51364311346315).
The spelling of 10132301023214 in words is "ten trillion, one hundred thirty-two billion, three hundred one million, twenty-three thousand, two hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •