Base | Representation |
---|---|
bin | 101011110011010010101… |
… | …001100010100101100011 |
3 | 101122202100212010112201121 |
4 | 223303102221202211203 |
5 | 343304000332242011 |
6 | 10222440254313111 |
7 | 430315612104340 |
oct | 53632251424543 |
9 | 11582325115647 |
10 | 3010011212131 |
11 | a605a1949610 |
12 | 40743a7b8797 |
13 | 18aac5944871 |
14 | a59847377c7 |
15 | 5346d5b8e71 |
hex | 2bcd2a62963 |
3010011212131 has 16 divisors (see below), whose sum is σ = 3752797091328. Its totient is φ = 2345428382400.
The previous prime is 3010011212111. The next prime is 3010011212179. The reversal of 3010011212131 is 1312121100103.
It is a happy number.
3010011212131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 3010011212131 - 29 = 3010011211619 is a prime.
It is a super-2 number, since 2×30100112121312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3010011212101) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5718751 + ... + 6222871.
It is an arithmetic number, because the mean of its divisors is an integer number (234549818208).
Almost surely, 23010011212131 is an apocalyptic number.
3010011212131 is a deficient number, since it is larger than the sum of its proper divisors (742785879197).
3010011212131 is a wasteful number, since it uses less digits than its factorization.
3010011212131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 581682.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 3010011212131 its reverse (1312121100103), we get a palindrome (4322132312234).
The spelling of 3010011212131 in words is "three trillion, ten billion, eleven million, two hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •