Base | Representation |
---|---|
bin | 100001101001001110101… |
… | …101101111110000101011 |
3 | 22012000201011101112102101 |
4 | 201221032231233300223 |
5 | 300340000313121303 |
6 | 4530042450514231 |
7 | 326015560263055 |
oct | 41511655576053 |
9 | 8160634345371 |
10 | 2312013020203 |
11 | 811579091a57 |
12 | 314100595977 |
13 | 13a039135c53 |
14 | 7dc8b23c8d5 |
15 | 4021a12ed1d |
hex | 21a4eb6fc2b |
2312013020203 has 8 divisors (see below), whose sum is σ = 2325764005200. Its totient is φ = 2298266480928.
The previous prime is 2312013020201. The next prime is 2312013020263. The reversal of 2312013020203 is 3020203102132.
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 2312013020203 - 21 = 2312013020201 is a prime.
It is a super-2 number, since 2×23120130202032 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2312013020201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 65313 + ... + 2151346.
It is an arithmetic number, because the mean of its divisors is an integer number (290720500650).
Almost surely, 22312013020203 is an apocalyptic number.
2312013020203 is a deficient number, since it is larger than the sum of its proper divisors (13750984997).
2312013020203 is a wasteful number, since it uses less digits than its factorization.
2312013020203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2222861.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 2312013020203 its reverse (3020203102132), we get a palindrome (5332216122335).
The spelling of 2312013020203 in words is "two trillion, three hundred twelve billion, thirteen million, twenty thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •