Base | Representation |
---|---|
bin | 10111000001000101110010… |
… | …111011001100110110110011 |
3 | 111021102111100121111112011010 |
4 | 113001011302323030312303 |
5 | 101232023031123234303 |
6 | 555144231535322003 |
7 | 30215425034312103 |
oct | 2701056273146663 |
9 | 437374317445133 |
10 | 101230012321203 |
11 | 2a289452992407 |
12 | b42b07a380303 |
13 | 4463c4551ac9c |
14 | 1add7b7271203 |
15 | ba8359219c03 |
hex | 5c1172eccdb3 |
101230012321203 has 16 divisors (see below), whose sum is σ = 135881038692000. Its totient is φ = 67032842599680.
The previous prime is 101230012321171. The next prime is 101230012321343. The reversal of 101230012321203 is 302123210032101.
It is not a de Polignac number, because 101230012321203 - 25 = 101230012321171 is a prime.
It is a super-2 number, since 2×1012300123212032 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 101230012321203.
It is not an unprimeable number, because it can be changed into a prime (101230012329203) 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, 32603863 + ... + 35573471.
It is an arithmetic number, because the mean of its divisors is an integer number (8492564918250).
Almost surely, 2101230012321203 is an apocalyptic number.
101230012321203 is a deficient number, since it is larger than the sum of its proper divisors (34651026370797).
101230012321203 is a wasteful number, since it uses less digits than its factorization.
101230012321203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3046022.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 101230012321203 its reverse (302123210032101), we get a palindrome (403353222353304).
The spelling of 101230012321203 in words is "one hundred one trillion, two hundred thirty billion, twelve million, three hundred twenty-one thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •