Base | Representation |
---|---|
bin | 1011110101010010011001… |
… | …1101011111000001000010 |
3 | 1201001202100022200210211111 |
4 | 2331110212131133001002 |
5 | 3201124141401444020 |
6 | 43400431420233534 |
7 | 2511643302406012 |
oct | 275244635370102 |
9 | 51052308623744 |
10 | 13010101203010 |
11 | 4166609a5805a |
12 | 156154069b8aa |
13 | 734b0261ab12 |
14 | 32d9997adc42 |
15 | 178651385d5a |
hex | bd52675f042 |
13010101203010 has 32 divisors (see below), whose sum is σ = 23424771801600. Its totient is φ = 5202576386112.
The previous prime is 13010101203007. The next prime is 13010101203013. The reversal of 13010101203010 is 1030210101031.
13010101203010 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (13010101203007) and next prime (13010101203013).
It is not an unprimeable number, because it can be changed into a prime (13010101203013) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 894219216 + ... + 894233764.
It is an arithmetic number, because the mean of its divisors is an integer number (732024118800).
Almost surely, 213010101203010 is an apocalyptic number.
13010101203010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13010101203010 is a deficient number, since it is larger than the sum of its proper divisors (10414670598590).
13010101203010 is a wasteful number, since it uses less digits than its factorization.
13010101203010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33570.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 13010101203010 its reverse (1030210101031), we get a palindrome (14040311304041).
The spelling of 13010101203010 in words is "thirteen trillion, ten billion, one hundred one million, two hundred three thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •