Base | Representation |
---|---|
bin | 100011000111010011110… |
… | …110110111110100001101 |
3 | 22112200110021121010121201 |
4 | 203013103312313310031 |
5 | 304013341420430104 |
6 | 5044310421225501 |
7 | 336223105222204 |
oct | 43072366676415 |
9 | 8480407533551 |
10 | 2413031030029 |
11 | 8503a7121994 |
12 | 32b7b3262291 |
13 | 14671781a169 |
14 | 84b1157823b |
15 | 42b7d9070a4 |
hex | 231d3db7d0d |
2413031030029 has 4 divisors (see below), whose sum is σ = 2437907638684. Its totient is φ = 2388154421376.
The previous prime is 2413031029991. The next prime is 2413031030041. The reversal of 2413031030029 is 9200301303142.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1692280969129 + 720750060900 = 1300877^2 + 848970^2 .
It is a cyclic number.
It is not a de Polignac number, because 2413031030029 - 29 = 2413031029517 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2413031029979 and 2413031030006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2413031033029) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12438304182 + ... + 12438304375.
It is an arithmetic number, because the mean of its divisors is an integer number (609476909671).
Almost surely, 22413031030029 is an apocalyptic number.
It is an amenable number.
2413031030029 is a deficient number, since it is larger than the sum of its proper divisors (24876608655).
2413031030029 is an equidigital number, since it uses as much as digits as its factorization.
2413031030029 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24876608654.
The product of its (nonzero) digits is 3888, while the sum is 28.
The spelling of 2413031030029 in words is "two trillion, four hundred thirteen billion, thirty-one million, thirty thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •