Base | Representation |
---|---|
bin | 1001000110110010011001… |
… | …0010101100010011001111 |
3 | 1022110011021012202112210122 |
4 | 2101230212102230103033 |
5 | 2303020002031414411 |
6 | 33143314001255155 |
7 | 2052233633010131 |
oct | 221544622542317 |
9 | 38404235675718 |
10 | 10012211201231 |
11 | 3210178229268 |
12 | 11585253344bb |
13 | 5781bbc99895 |
14 | 268844c07051 |
15 | 125691ed19db |
hex | 91b264ac4cf |
10012211201231 has 4 divisors (see below), whose sum is σ = 10068145342200. Its totient is φ = 9956277060264.
The previous prime is 10012211201197. The next prime is 10012211201243. The reversal of 10012211201231 is 13210211221001.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10012211201231 is a prime.
It is a super-2 number, since 2×100122112012312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10012211201131) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 27967070216 + ... + 27967070573.
It is an arithmetic number, because the mean of its divisors is an integer number (2517036335550).
Almost surely, 210012211201231 is an apocalyptic number.
10012211201231 is a deficient number, since it is larger than the sum of its proper divisors (55934140969).
10012211201231 is an equidigital number, since it uses as much as digits as its factorization.
10012211201231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55934140968.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 10012211201231 its reverse (13210211221001), we get a palindrome (23222422422232).
The spelling of 10012211201231 in words is "ten trillion, twelve billion, two hundred eleven million, two hundred one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •