Base | Representation |
---|---|
bin | 101010001100110110001… |
… | …100001110100111111101 |
3 | 101021020102211101200102000 |
4 | 222030312030032213331 |
5 | 340003211044200333 |
6 | 10100125215452513 |
7 | 416343001062603 |
oct | 52146614164775 |
9 | 11236384350360 |
10 | 2900012100093 |
11 | a18985255659 |
12 | 3aa060227139 |
13 | 180615698ba4 |
14 | a050b705873 |
15 | 506815e9713 |
hex | 2a33630e9fd |
2900012100093 has 32 divisors (see below), whose sum is σ = 4331541312000. Its totient is φ = 1917527571648.
The previous prime is 2900012100043. The next prime is 2900012100101. The reversal of 2900012100093 is 3900012100092.
It is not a de Polignac number, because 2900012100093 - 222 = 2900007905789 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2900012100043) 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 31 ways as a sum of consecutive naturals, for example, 2191180 + ... + 3255962.
It is an arithmetic number, because the mean of its divisors is an integer number (135360666000).
Almost surely, 22900012100093 is an apocalyptic number.
It is an amenable number.
2900012100093 is a deficient number, since it is larger than the sum of its proper divisors (1431529211907).
2900012100093 is a wasteful number, since it uses less digits than its factorization.
2900012100093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1065618 (or 1065612 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 27.
Subtracting 2900012100093 from its reverse (3900012100092), we obtain a palindrome (999999999999).
The spelling of 2900012100093 in words is "two trillion, nine hundred billion, twelve million, one hundred thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •