Base | Representation |
---|---|
bin | 1110010011101111101100… |
… | …01111101010111100101101 |
3 | 11010102000001200202011111122 |
4 | 13021313312033222330231 |
5 | 13111004320241341123 |
6 | 150530414142030325 |
7 | 6425153152324640 |
oct | 711676617527455 |
9 | 133360050664448 |
10 | 31464766746413 |
11 | a0311505a8550 |
12 | 36420ba8783a5 |
13 | 14731652039c0 |
14 | 7aac8d54da57 |
15 | 39870ddbabc8 |
hex | 1c9df63eaf2d |
31464766746413 has 16 divisors (see below), whose sum is σ = 42246400108416. Its totient is φ = 22632000056640.
The previous prime is 31464766746409. The next prime is 31464766746437.
It is a happy number.
31464766746413 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 31464766746413 - 22 = 31464766746409 is a prime.
It is a super-3 number, since 3×314647667464133 (a number of 41 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31464766746403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15716665706 + ... + 15716667707.
It is an arithmetic number, because the mean of its divisors is an integer number (2640400006776).
Almost surely, 231464766746413 is an apocalyptic number.
It is an amenable number.
31464766746413 is a deficient number, since it is larger than the sum of its proper divisors (10781633362003).
31464766746413 is a wasteful number, since it uses less digits than its factorization.
31464766746413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31433333444.
The product of its digits is 146313216, while the sum is 62.
The spelling of 31464766746413 in words is "thirty-one trillion, four hundred sixty-four billion, seven hundred sixty-six million, seven hundred forty-six thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •