Base | Representation |
---|---|
bin | 1001001101000011111110… |
… | …1110001001011101000010 |
3 | 1022211110112001000002202220 |
4 | 2103100333232021131002 |
5 | 2311301241033330310 |
6 | 33305022550551510 |
7 | 2063101221534204 |
oct | 223207756113502 |
9 | 38743461002686 |
10 | 10120012011330 |
11 | 3251966a52461 |
12 | 11753ab668596 |
13 | 58540b989a90 |
14 | 26db4dcc0774 |
15 | 1283a0ebc670 |
hex | 9343fb89742 |
10120012011330 has 32 divisors (see below), whose sum is σ = 26156338737984. Its totient is φ = 2491079879616.
The previous prime is 10120012011271. The next prime is 10120012011353. The reversal of 10120012011330 is 3311021002101.
It is a happy number.
10120012011330 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (15).
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, 12974373984 + ... + 12974374763.
It is an arithmetic number, because the mean of its divisors is an integer number (817385585562).
Almost surely, 210120012011330 is an apocalyptic number.
10120012011330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10120012011330 is an abundant number, since it is smaller than the sum of its proper divisors (16036326726654).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10120012011330 is a wasteful number, since it uses less digits than its factorization.
10120012011330 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25948748770.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 10120012011330 its reverse (3311021002101), we get a palindrome (13431033013431).
The spelling of 10120012011330 in words is "ten trillion, one hundred twenty billion, twelve million, eleven thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •