Base | Representation |
---|---|
bin | 101100000000011011000… |
… | …100000000110110110101 |
3 | 101201002202111101122202202 |
4 | 230000123010000312311 |
5 | 344021334404411201 |
6 | 10233131334114245 |
7 | 431325201326360 |
oct | 54003304006665 |
9 | 11632674348682 |
10 | 3024111013301 |
11 | a66577912954 |
12 | 40a1147ab985 |
13 | 18c231b27891 |
14 | a652118d0d7 |
15 | 539e6362c6b |
hex | 2c01b100db5 |
3024111013301 has 32 divisors (see below), whose sum is σ = 3603676594176. Its totient is φ = 2483133480000.
The previous prime is 3024111013249. The next prime is 3024111013307. The reversal of 3024111013301 is 1033101114203.
It is a de Polignac number, because none of the positive numbers 2k-3024111013301 is a prime.
It is a super-3 number, since 3×30241110133013 (a number of 38 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3024111013307) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 137255156 + ... + 137277186.
It is an arithmetic number, because the mean of its divisors is an integer number (112614893568).
Almost surely, 23024111013301 is an apocalyptic number.
3024111013301 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
It is an amenable number.
3024111013301 is a deficient number, since it is larger than the sum of its proper divisors (579565580875).
3024111013301 is a wasteful number, since it uses less digits than its factorization.
3024111013301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28433.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 3024111013301 its reverse (1033101114203), we get a palindrome (4057212127504).
The spelling of 3024111013301 in words is "three trillion, twenty-four billion, one hundred eleven million, thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •