Base | Representation |
---|---|
bin | 1001010010010011101011… |
… | …0100000111001011010001 |
3 | 1100011002010002121112012212 |
4 | 2110210322310013023101 |
5 | 2314240313221031001 |
6 | 33414244411401505 |
7 | 2102441251033160 |
oct | 224447264071321 |
9 | 40132102545185 |
10 | 10210124002001 |
11 | 32870a8904820 |
12 | 118a959a53295 |
13 | 590a6ca60511 |
14 | 27425ba113d7 |
15 | 12a8c70bb7bb |
hex | 9493ad072d1 |
10210124002001 has 8 divisors (see below), whose sum is σ = 12729505249344. Its totient is φ = 7955940780720.
The previous prime is 10210124001991. The next prime is 10210124002031. The reversal of 10210124002001 is 10020042101201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10210124002001 - 242 = 5812077490897 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10210124002031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 66299506430 + ... + 66299506583.
It is an arithmetic number, because the mean of its divisors is an integer number (1591188156168).
Almost surely, 210210124002001 is an apocalyptic number.
10210124002001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10210124002001 is a deficient number, since it is larger than the sum of its proper divisors (2519381247343).
10210124002001 is a wasteful number, since it uses less digits than its factorization.
10210124002001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 132599013031.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 10210124002001 its reverse (10020042101201), we get a palindrome (20230166103202).
The spelling of 10210124002001 in words is "ten trillion, two hundred ten billion, one hundred twenty-four million, two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •