Base | Representation |
---|---|
bin | 101111110000000011001011… |
… | …011000000111010001010100 |
3 | 1000112120202212020220010000020 |
4 | 233300003023120013101110 |
5 | 210011301223022020200 |
6 | 2022353153451545140 |
7 | 62143505605035012 |
oct | 5760031330072124 |
9 | 1015522766803006 |
10 | 210010133001300 |
11 | 60a08885143205 |
12 | 1b67945475b1b0 |
13 | 9024b41831458 |
14 | 39c078a8178b2 |
15 | 1942ca38b2ea0 |
hex | bf00cb607454 |
210010133001300 has 36 divisors (see below), whose sum is σ = 607629318151296. Its totient is φ = 56002702133600.
The previous prime is 210010133001293. The next prime is 210010133001343. The reversal of 210010133001300 is 3100331010012.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 210010133001300.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 350016888036 + ... + 350016888635.
Almost surely, 2210010133001300 is an apocalyptic number.
210010133001300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
210010133001300 is an abundant number, since it is smaller than the sum of its proper divisors (397619185149996).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210010133001300 is a wasteful number, since it uses less digits than its factorization.
210010133001300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 700033776688 (or 700033776681 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 210010133001300 its reverse (3100331010012), we get a palindrome (213110464011312).
The spelling of 210010133001300 in words is "two hundred ten trillion, ten billion, one hundred thirty-three million, one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •