Base | Representation |
---|---|
bin | 11101101101110010001… |
… | …11100101100100111000 |
3 | 10121121102011010121002100 |
4 | 32312321013211210320 |
5 | 113212013313214112 |
6 | 2101014044303400 |
7 | 133523440333602 |
oct | 16667107454470 |
9 | 3547364117070 |
10 | 1021013023032 |
11 | 364011263132 |
12 | 145a67241b60 |
13 | 753867c0192 |
14 | 375bb0aa172 |
15 | 1b85b3d72dc |
hex | edb91e5938 |
1021013023032 has 96 divisors (see below), whose sum is σ = 2939602770000. Its totient is φ = 319232793600.
The previous prime is 1021013023021. The next prime is 1021013023049. The reversal of 1021013023032 is 2303203101201.
It is a super-3 number, since 3×10210130230323 (a number of 37 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 1021013022996 and 1021013023014.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3556657 + ... + 3832992.
Almost surely, 21021013023032 is an apocalyptic number.
1021013023032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1021013023032 is an abundant number, since it is smaller than the sum of its proper divisors (1918589746968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1021013023032 is a wasteful number, since it uses less digits than its factorization.
1021013023032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7389781 (or 7389774 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 1021013023032 its reverse (2303203101201), we get a palindrome (3324216124233).
The spelling of 1021013023032 in words is "one trillion, twenty-one billion, thirteen million, twenty-three thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •