Base | Representation |
---|---|
bin | 1110010100101111101110… |
… | …01100000111111111000000 |
3 | 11010112021210101110212101020 |
4 | 13022113313030013333000 |
5 | 13112040220414113402 |
6 | 150554301202105440 |
7 | 6430511053100052 |
oct | 712276714077700 |
9 | 133467711425336 |
10 | 31499142332352 |
11 | a044790736002 |
12 | 36488b304b280 |
13 | 1476482c614b6 |
14 | 7ac7d0b598d2 |
15 | 399571c098bc |
hex | 1ca5f7307fc0 |
31499142332352 has 56 divisors (see below), whose sum is σ = 84345595022976. Its totient is φ = 10373211525888.
The previous prime is 31499142332351. The next prime is 31499142332389. The reversal of 31499142332352 is 25323324199413.
It is a junction number, because it is equal to n+sod(n) for n = 31499142332295 and 31499142332304.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31499142332351) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 988285468 + ... + 988317339.
It is an arithmetic number, because the mean of its divisors is an integer number (1506171339696).
Almost surely, 231499142332352 is an apocalyptic number.
31499142332352 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
31499142332352 is an abundant number, since it is smaller than the sum of its proper divisors (52846452690624).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31499142332352 is a wasteful number, since it uses less digits than its factorization.
31499142332352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1976602905 (or 1976602895 counting only the distinct ones).
The product of its digits is 4199040, while the sum is 51.
The spelling of 31499142332352 in words is "thirty-one trillion, four hundred ninety-nine billion, one hundred forty-two million, three hundred thirty-two thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •