Base | Representation |
---|---|
bin | 101111100000001000… |
… | …1101110101100101001 |
3 | 100202022021001001212200 |
4 | 1133000101232230221 |
5 | 3132404042333001 |
6 | 114510210530413 |
7 | 10240622502405 |
oct | 1370021565451 |
9 | 322267031780 |
10 | 102010121001 |
11 | 3a298065828 |
12 | 1792ab96a09 |
13 | 98090bb759 |
14 | 4d19dd2105 |
15 | 29c094b086 |
hex | 17c046eb29 |
102010121001 has 24 divisors (see below), whose sum is σ = 156124991880. Its totient is φ = 63961422336.
The previous prime is 102010120999. The next prime is 102010121027. The reversal of 102010121001 is 100121010201.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 27862286400 + 74147834601 = 166920^2 + 272301^2 .
It is not a de Polignac number, because 102010121001 - 21 = 102010120999 is a prime.
It is a super-2 number, since 2×1020101210012 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (102010122001) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 14650 + ... + 451923.
It is an arithmetic number, because the mean of its divisors is an integer number (6505207995).
Almost surely, 2102010121001 is an apocalyptic number.
It is an amenable number.
102010121001 is a deficient number, since it is larger than the sum of its proper divisors (54114870879).
102010121001 is a wasteful number, since it uses less digits than its factorization.
102010121001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 468025 (or 468022 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 102010121001 its reverse (100121010201), we get a palindrome (202131131202).
The spelling of 102010121001 in words is "one hundred two billion, ten million, one hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •