Base | Representation |
---|---|
bin | 11100110111110011… |
… | …110110100111101100 |
3 | 2222000112001121112001 |
4 | 130313303312213230 |
5 | 1001442241023040 |
6 | 22124113222044 |
7 | 2145144044605 |
oct | 346763664754 |
9 | 88015047461 |
10 | 31001111020 |
11 | 12169356610 |
12 | 6012261924 |
13 | 2c00900b99 |
14 | 17013a4dac |
15 | c1697959a |
hex | 737cf69ec |
31001111020 has 48 divisors (see below), whose sum is σ = 71094659328. Its totient is φ = 11261396160.
The previous prime is 31001110997. The next prime is 31001111023. The reversal of 31001111020 is 2011110013.
It is a super-2 number, since 2×310011110202 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 31001110988 and 31001111006.
It is not an unprimeable number, because it can be changed into a prime (31001111023) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 139879 + ... + 285601.
It is an arithmetic number, because the mean of its divisors is an integer number (1481138736).
Almost surely, 231001111020 is an apocalyptic number.
It is an amenable number.
31001111020 is an abundant number, since it is smaller than the sum of its proper divisors (40093548308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31001111020 is a wasteful number, since it uses less digits than its factorization.
31001111020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146710 (or 146708 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 10.
Adding to 31001111020 its reverse (2011110013), we get a palindrome (33012221033).
The spelling of 31001111020 in words is "thirty-one billion, one million, one hundred eleven thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •