Base | Representation |
---|---|
bin | 1110001101000010000100… |
… | …00110010111110100101101 |
3 | 11002120221200220112111010010 |
4 | 13012201002012113310231 |
5 | 13043214424423040323 |
6 | 150232430320003433 |
7 | 6402406251130326 |
oct | 706410206276455 |
9 | 132527626474103 |
10 | 31234111143213 |
11 | 9a523485179a0 |
12 | 3605468760579 |
13 | 1457496a56264 |
14 | 79da4bd2544d |
15 | 39270e4b9c93 |
hex | 1c6842197d2d |
31234111143213 has 16 divisors (see below), whose sum is σ = 45662050817856. Its totient is φ = 18833674151040.
The previous prime is 31234111143181. The next prime is 31234111143239.
It is a happy number.
31234111143213 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 31234111143213 - 25 = 31234111143181 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31234111143913) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2402247856 + ... + 2402260857.
It is an arithmetic number, because the mean of its divisors is an integer number (2853878176116).
Almost surely, 231234111143213 is an apocalyptic number.
31234111143213 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
It is an amenable number.
31234111143213 is a deficient number, since it is larger than the sum of its proper divisors (14427939674643).
31234111143213 is a wasteful number, since it uses less digits than its factorization.
31234111143213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4804508924.
The product of its digits is 5184, while the sum is 30.
It can be divided in two parts, 3123411 and 1143213, that added together give a palindrome (4266624).
The spelling of 31234111143213 in words is "thirty-one trillion, two hundred thirty-four billion, one hundred eleven million, one hundred forty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •