Base | Representation |
---|---|
bin | 11010001100101100101… |
… | …00001110110111000101 |
3 | 10012001111101202120101000 |
4 | 31012112110032313011 |
5 | 104222022013113023 |
6 | 1525311000123513 |
7 | 122015024121042 |
oct | 15062624166705 |
9 | 3161441676330 |
10 | 900170051013 |
11 | 31783a587722 |
12 | 126561166599 |
13 | 66b68a886cc |
14 | 317d5c101c9 |
15 | 1863741c243 |
hex | d19650edc5 |
900170051013 has 32 divisors (see below), whose sum is σ = 1334861349120. Its totient is φ = 599539484160.
The previous prime is 900170051009. The next prime is 900170051047. The reversal of 900170051013 is 310150071009.
It is a happy number.
900170051013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 900170051013 - 22 = 900170051009 is a prime.
It is a super-2 number, since 2×9001700510132 (a number of 25 digits) contains 22 as substring.
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 (900170051003) 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, 213460081 + ... + 213464297.
It is an arithmetic number, because the mean of its divisors is an integer number (41714417160).
Almost surely, 2900170051013 is an apocalyptic number.
It is an amenable number.
900170051013 is a deficient number, since it is larger than the sum of its proper divisors (434691298107).
900170051013 is a wasteful number, since it uses less digits than its factorization.
900170051013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9914 (or 9908 counting only the distinct ones).
The product of its (nonzero) digits is 945, while the sum is 27.
The spelling of 900170051013 in words is "nine hundred billion, one hundred seventy million, fifty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •