Base | Representation |
---|---|
bin | 1001001100000000111011… |
… | …0110010100100011110000 |
3 | 1022202202001121012000012110 |
4 | 2103000032312110203300 |
5 | 2311002410110414300 |
6 | 33252444512325320 |
7 | 2061563164632513 |
oct | 223001666244360 |
9 | 38682047160173 |
10 | 10102012201200 |
11 | 324526a58a717 |
12 | 1171a07543840 |
13 | 5838007c4a5a |
14 | 26cd23502d7a |
15 | 127b9ab50550 |
hex | 9300ed948f0 |
10102012201200 has 60 divisors (see below), whose sum is σ = 32360112421688. Its totient is φ = 2693869920000.
The previous prime is 10102012201139. The next prime is 10102012201207. The reversal of 10102012201200 is 210221020101.
It is a tau number, because it is divible by the number of its divisors (60).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10102012201207) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4209170551 + ... + 4209172950.
Almost surely, 210102012201200 is an apocalyptic number.
10102012201200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10102012201200 is an abundant number, since it is smaller than the sum of its proper divisors (22258100220488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10102012201200 is a wasteful number, since it uses less digits than its factorization.
10102012201200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8418343522 (or 8418343511 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 10102012201200 its reverse (210221020101), we get a palindrome (10312233221301).
The spelling of 10102012201200 in words is "ten trillion, one hundred two billion, twelve million, two hundred one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •