Base | Representation |
---|---|
bin | 11101011101111100100… |
… | …11001101110111010110 |
3 | 10120210110120020110000220 |
4 | 32232332103031313112 |
5 | 113042110031220001 |
6 | 2053050215415210 |
7 | 133102641123450 |
oct | 16567623156726 |
9 | 3523416213026 |
10 | 1012510023126 |
11 | 36044856a488 |
12 | 144293684506 |
13 | 7462ccb46a4 |
14 | 37011aa92d0 |
15 | 1b50eb7ec36 |
hex | ebbe4cddd6 |
1012510023126 has 32 divisors (see below), whose sum is σ = 2331975115008. Its totient is φ = 287080266720.
The previous prime is 1012510023101. The next prime is 1012510023127. The reversal of 1012510023126 is 6213200152101.
It is a happy number.
It is a super-3 number, since 3×10125100231263 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 1012510023096 and 1012510023105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012510023127) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 92007405 + ... + 92018408.
It is an arithmetic number, because the mean of its divisors is an integer number (72874222344).
Almost surely, 21012510023126 is an apocalyptic number.
1012510023126 is an abundant number, since it is smaller than the sum of its proper divisors (1319465091882).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1012510023126 is a wasteful number, since it uses less digits than its factorization.
1012510023126 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 184025956.
The product of its (nonzero) digits is 720, while the sum is 24.
Adding to 1012510023126 its reverse (6213200152101), we get a palindrome (7225710175227).
The spelling of 1012510023126 in words is "one trillion, twelve billion, five hundred ten million, twenty-three thousand, one hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •