Base | Representation |
---|---|
bin | 1001001101110000101011… |
… | …1111010111001001010101 |
3 | 1022212121111100112112121111 |
4 | 2103130022333113021111 |
5 | 2312000330112431201 |
6 | 33314325425215021 |
7 | 2064004464664120 |
oct | 223341277271125 |
9 | 38777440475544 |
10 | 10132012233301 |
11 | 3256a64845882 |
12 | 117779a491471 |
13 | 5865a1b9b63a |
14 | 27056b9593b7 |
15 | 128854783b51 |
hex | 9370afd7255 |
10132012233301 has 8 divisors (see below), whose sum is σ = 11579506448384. Its totient is φ = 8684533992240.
The previous prime is 10132012233289. The next prime is 10132012233323. The reversal of 10132012233301 is 10333221023101.
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 10132012233301 - 213 = 10132012225109 is a prime.
It is a super-2 number, since 2×101320122333012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10132012233341) 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, 2602005 + ... + 5199466.
It is an arithmetic number, because the mean of its divisors is an integer number (1447438306048).
Almost surely, 210132012233301 is an apocalyptic number.
It is an amenable number.
10132012233301 is a deficient number, since it is larger than the sum of its proper divisors (1447494215083).
10132012233301 is an equidigital number, since it uses as much as digits as its factorization.
10132012233301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7987011.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 10132012233301 its reverse (10333221023101), we get a palindrome (20465233256402).
The spelling of 10132012233301 in words is "ten trillion, one hundred thirty-two billion, twelve million, two hundred thirty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •