Base | Representation |
---|---|
bin | 11101001010011000111… |
… | …01001110100100010000 |
3 | 10112210100210210121022212 |
4 | 32211030131032210100 |
5 | 112404104042011344 |
6 | 2044152254051252 |
7 | 132251513256464 |
oct | 16451435164420 |
9 | 3483323717285 |
10 | 1002010110224 |
11 | 356a4a648512 |
12 | 1422431a9b28 |
13 | 73648872986 |
14 | 366d73b44a4 |
15 | 1b0e7e7479e |
hex | e94c74e910 |
1002010110224 has 10 divisors (see below), whose sum is σ = 1941394588590. Its totient is φ = 501005055104.
The previous prime is 1002010110223. The next prime is 1002010110239. The reversal of 1002010110224 is 4220110102001.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 958049440000 + 43960670224 = 978800^2 + 209668^2 .
It is a super-2 number, since 2×10020101102242 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1002010110199 and 1002010110208.
It is not an unprimeable number, because it can be changed into a prime (1002010110223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 31312815929 + ... + 31312815960.
It is an arithmetic number, because the mean of its divisors is an integer number (194139458859).
Almost surely, 21002010110224 is an apocalyptic number.
It is an amenable number.
1002010110224 is a deficient number, since it is larger than the sum of its proper divisors (939384478366).
1002010110224 is an equidigital number, since it uses as much as digits as its factorization.
1002010110224 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62625631897 (or 62625631891 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 1002010110224 its reverse (4220110102001), we get a palindrome (5222120212225).
The spelling of 1002010110224 in words is "one trillion, two billion, ten million, one hundred ten thousand, two hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •