Base | Representation |
---|---|
bin | 1110001001011101001011… |
… | …10100000001001111010010 |
3 | 11002011012112002222202001200 |
4 | 13010232211310001033102 |
5 | 13034211244340032010 |
6 | 150100145102412030 |
7 | 6360466165511565 |
oct | 704564564011722 |
9 | 132135462882050 |
10 | 31111230002130 |
11 | 9a052202a4943 |
12 | 35a5693b91016 |
13 | 1448a129a20a5 |
14 | 797b120b64dc |
15 | 38e41b5eccc0 |
hex | 1c4ba5d013d2 |
31111230002130 has 48 divisors (see below), whose sum is σ = 80890121841984. Its totient is φ = 8296233248160.
The previous prime is 31111230002117. The next prime is 31111230002141. The reversal of 31111230002130 is 3120003211113.
31111230002130 is a `hidden beast` number, since 311 + 1 + 1 + 2 + 300 + 0 + 21 + 30 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6133977 + ... + 9992403.
It is an arithmetic number, because the mean of its divisors is an integer number (1685210871708).
Almost surely, 231111230002130 is an apocalyptic number.
31111230002130 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
31111230002130 is an abundant number, since it is smaller than the sum of its proper divisors (49778891839854).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31111230002130 is a wasteful number, since it uses less digits than its factorization.
31111230002130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3948031 (or 3948028 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 31111230002130 its reverse (3120003211113), we get a palindrome (34231233213243).
The spelling of 31111230002130 in words is "thirty-one trillion, one hundred eleven billion, two hundred thirty million, two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.183 sec. • engine limits •