Base | Representation |
---|---|
bin | 1110001001001101111001… |
… | …01001100110101010011100 |
3 | 11002010102100011110200002120 |
4 | 13010212330221212222130 |
5 | 13034042442420310322 |
6 | 150052310454422540 |
7 | 6360055624120356 |
oct | 704467451465234 |
9 | 132112304420076 |
10 | 31103023213212 |
11 | 9a01799827965 |
12 | 35a3b83661a50 |
13 | 1448005668882 |
14 | 7975741800d6 |
15 | 38e0dada6a5c |
hex | 1c49bca66a9c |
31103023213212 has 24 divisors (see below), whose sum is σ = 76393390348800. Its totient is φ = 9822007330416.
The previous prime is 31103023213187. The next prime is 31103023213247. The reversal of 31103023213212 is 21231232030113.
It is a super-2 number, since 2×311030232132122 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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, 68208384012 + ... + 68208384467.
It is an arithmetic number, because the mean of its divisors is an integer number (3183057931200).
Almost surely, 231103023213212 is an apocalyptic number.
It is an amenable number.
31103023213212 is an abundant number, since it is smaller than the sum of its proper divisors (45290367135588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31103023213212 is a wasteful number, since it uses less digits than its factorization.
31103023213212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136416768505 (or 136416768503 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 31103023213212 its reverse (21231232030113), we get a palindrome (52334255243325).
The spelling of 31103023213212 in words is "thirty-one trillion, one hundred three billion, twenty-three million, two hundred thirteen thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •