Base | Representation |
---|---|
bin | 1001000110101101111101… |
… | …0110100001011100100010 |
3 | 1022110001012021020020012210 |
4 | 2101223133112201130202 |
5 | 2303010032340214020 |
6 | 33142555523502550 |
7 | 2052162301446600 |
oct | 221533726413442 |
9 | 38401167206183 |
10 | 10011021023010 |
11 | 320a7174207a7 |
12 | 1158252827a56 |
13 | 57805c533b07 |
14 | 268770b12870 |
15 | 1256227863e0 |
hex | 91adf5a1722 |
10011021023010 has 48 divisors (see below), whose sum is σ = 27949136247936. Its totient is φ = 2288233376352.
The previous prime is 10011021022997. The next prime is 10011021023011. The reversal of 10011021023010 is 1032012011001.
10011021023010 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (10011021023011) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3405107722 + ... + 3405110661.
It is an arithmetic number, because the mean of its divisors is an integer number (582273671832).
Almost surely, 210011021023010 is an apocalyptic number.
10011021023010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10011021023010 is an abundant number, since it is smaller than the sum of its proper divisors (17938115224926).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10011021023010 is a wasteful number, since it uses less digits than its factorization.
10011021023010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6810218407 (or 6810218400 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 10011021023010 its reverse (1032012011001), we get a palindrome (11043033034011).
The spelling of 10011021023010 in words is "ten trillion, eleven billion, twenty-one million, twenty-three thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •