Base | Representation |
---|---|
bin | 1001001101101010011011… |
… | …0101110111100011101100 |
3 | 1022212110011020221000102002 |
4 | 2103122212311313203230 |
5 | 2311433404444214040 |
6 | 33313451004351432 |
7 | 2063615033303636 |
oct | 223324665674354 |
9 | 38773136830362 |
10 | 10130332023020 |
11 | 3256282369a40 |
12 | 11773ab845578 |
13 | 586394a60881 |
14 | 27044c745a56 |
15 | 1287a6edda15 |
hex | 936a6d778ec |
10130332023020 has 48 divisors (see below), whose sum is σ = 23208256124928. Its totient is φ = 3683664020160.
The previous prime is 10130332022999. The next prime is 10130332023037. The reversal of 10130332023020 is 2032023303101.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 10130332022983 and 10130332023001.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8463827 + ... + 9586293.
It is an arithmetic number, because the mean of its divisors is an integer number (483505335936).
Almost surely, 210130332023020 is an apocalyptic number.
10130332023020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10130332023020 is an abundant number, since it is smaller than the sum of its proper divisors (13077924101908).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10130332023020 is a wasteful number, since it uses less digits than its factorization.
10130332023020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1163510 (or 1163508 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 10130332023020 its reverse (2032023303101), we get a palindrome (12162355326121).
The spelling of 10130332023020 in words is "ten trillion, one hundred thirty billion, three hundred thirty-two million, twenty-three thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •