Base | Representation |
---|---|
bin | 1010111100010011110000… |
… | …1011011000000001001111 |
3 | 1120121011122220212100110202 |
4 | 2233010330023120001033 |
5 | 3034104411012323043 |
6 | 41331021333124115 |
7 | 2351140450146443 |
oct | 257047413300117 |
9 | 46534586770422 |
10 | 12031213011023 |
11 | 3919455100a88 |
12 | 1423890a8963b |
13 | 69370018338b |
14 | 2d8457182823 |
15 | 15ce5d2a51b8 |
hex | af13c2d804f |
12031213011023 has 4 divisors (see below), whose sum is σ = 12042467654760. Its totient is φ = 12019958367288.
The previous prime is 12031213011011. The next prime is 12031213011107. The reversal of 12031213011023 is 32011031213021.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12031213011023 - 224 = 12031196233807 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12031213010986 and 12031213011004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12031213013023) 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, 5627320265 + ... + 5627322402.
It is an arithmetic number, because the mean of its divisors is an integer number (3010616913690).
Almost surely, 212031213011023 is an apocalyptic number.
12031213011023 is a deficient number, since it is larger than the sum of its proper divisors (11254643737).
12031213011023 is a wasteful number, since it uses less digits than its factorization.
12031213011023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11254643736.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 12031213011023 its reverse (32011031213021), we get a palindrome (44042244224044).
The spelling of 12031213011023 in words is "twelve trillion, thirty-one billion, two hundred thirteen million, eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •