Base | Representation |
---|---|
bin | 11101000100011001… |
… | …001000011101101110 |
3 | 2222120020021112220220 |
4 | 131010121020131232 |
5 | 1002410311210110 |
6 | 22201053552210 |
7 | 2153316256611 |
oct | 350431103556 |
9 | 88506245826 |
10 | 31212210030 |
11 | 1226752a401 |
12 | 6070aa5666 |
13 | 2c35573041 |
14 | 1721436178 |
15 | c2a277370 |
hex | 74464876e |
31212210030 has 32 divisors (see below), whose sum is σ = 78166232064. Its totient is φ = 7961375136.
The previous prime is 31212209999. The next prime is 31212210037. The reversal of 31212210030 is 3001221213.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a junction number, because it is equal to n+sod(n) for n = 31212209991 and 31212210009.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31212210037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 22616854 + ... + 22618233.
It is an arithmetic number, because the mean of its divisors is an integer number (2442694752).
Almost surely, 231212210030 is an apocalyptic number.
31212210030 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
31212210030 is an abundant number, since it is smaller than the sum of its proper divisors (46954022034).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31212210030 is a wasteful number, since it uses less digits than its factorization.
31212210030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45235120.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 31212210030 its reverse (3001221213), we get a palindrome (34213431243).
The spelling of 31212210030 in words is "thirty-one billion, two hundred twelve million, two hundred ten thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •