Base | Representation |
---|---|
bin | 1001000110110110100011… |
… | …1111011000010010101101 |
3 | 1022110021011012101012000102 |
4 | 2101231220333120102231 |
5 | 2303024300013241023 |
6 | 33144021013440445 |
7 | 2052303441312212 |
oct | 221555077302255 |
9 | 38407135335012 |
10 | 10013330212013 |
11 | 32106a1948667 |
12 | 1158798040125 |
13 | 578339a7563b |
14 | 26890d693b09 |
15 | 12570a370628 |
hex | 91b68fd84ad |
10013330212013 has 8 divisors (see below), whose sum is σ = 10671005000448. Its totient is φ = 9374181474064.
The previous prime is 10013330212007. The next prime is 10013330212021. The reversal of 10013330212013 is 31021203331001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10013330212013 - 226 = 10013263103149 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10013330212003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4631511506 + ... + 4631513667.
It is an arithmetic number, because the mean of its divisors is an integer number (1333875625056).
Almost surely, 210013330212013 is an apocalyptic number.
It is an amenable number.
10013330212013 is a deficient number, since it is larger than the sum of its proper divisors (657674788435).
10013330212013 is an equidigital number, since it uses as much as digits as its factorization.
10013330212013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9263025243.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 10013330212013 its reverse (31021203331001), we get a palindrome (41034533543014).
The spelling of 10013330212013 in words is "ten trillion, thirteen billion, three hundred thirty million, two hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •