Base | Representation |
---|---|
bin | 10010111011101010001… |
… | …111010101000001011000 |
3 | 11121101010121212021202100 |
4 | 102323222033111001120 |
5 | 132303432030311300 |
6 | 2433401543403400 |
7 | 162665145423465 |
oct | 22735217250130 |
9 | 4541117767670 |
10 | 1301010010200 |
11 | 46183426286a |
12 | 190189753560 |
13 | 958b942aa04 |
14 | 46d7d78066c |
15 | 23c97932700 |
hex | 12eea3d5058 |
1301010010200 has 288 divisors, whose sum is σ = 4681985490000. Its totient is φ = 322593300480.
The previous prime is 1301010010087. The next prime is 1301010010241. The reversal of 1301010010200 is 20100101031.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 2283676 + ... + 2795924.
Almost surely, 21301010010200 is an apocalyptic number.
1301010010200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1301010010200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2340992745000).
1301010010200 is an abundant number, since it is smaller than the sum of its proper divisors (3380975479800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1301010010200 is a wasteful number, since it uses less digits than its factorization.
1301010010200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 512371 (or 512359 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 1301010010200 its reverse (20100101031), we get a palindrome (1321110111231).
The spelling of 1301010010200 in words is "one trillion, three hundred one billion, ten million, ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •