Base | Representation |
---|---|
bin | 10010111100110111110… |
… | …010010010010111101010 |
3 | 11121111111021221102200212 |
4 | 102330313302102113222 |
5 | 132314113110120020 |
6 | 2434135020501122 |
7 | 163042324011140 |
oct | 22746762222752 |
9 | 4544437842625 |
10 | 1302311020010 |
11 | 46234168a790 |
12 | 1904913aa7a2 |
13 | 95a65b2a4c0 |
14 | 47064485590 |
15 | 23d21c71cc5 |
hex | 12f37c925ea |
1302311020010 has 128 divisors (see below), whose sum is σ = 3182769676800. Its totient is φ = 370480619520.
The previous prime is 1302311020009. The next prime is 1302311020019. The reversal of 1302311020010 is 100201132031.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1302311020019) 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 63 ways as a sum of consecutive naturals, for example, 159986 + ... + 1621794.
It is an arithmetic number, because the mean of its divisors is an integer number (24865388100).
Almost surely, 21302311020010 is an apocalyptic number.
1302311020010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1302311020010 is an abundant number, since it is smaller than the sum of its proper divisors (1880458656790).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1302311020010 is a wasteful number, since it uses less digits than its factorization.
1302311020010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1461936.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 1302311020010 its reverse (100201132031), we get a palindrome (1402512152041).
The spelling of 1302311020010 in words is "one trillion, three hundred two billion, three hundred eleven million, twenty thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •