Base | Representation |
---|---|
bin | 10111011100101000000010… |
… | …010010100111110100101101 |
3 | 111112010101102122111020102111 |
4 | 113130220002102213310231 |
5 | 102004023233010304401 |
6 | 1003153404113124021 |
7 | 30502222220442502 |
oct | 2734500222476455 |
9 | 445111378436374 |
10 | 103122203213101 |
11 | 2a948976361646 |
12 | b695935259611 |
13 | 45704c74481a7 |
14 | 1b671d98c74a9 |
15 | bdc6a261ce51 |
hex | 5dca024a7d2d |
103122203213101 has 16 divisors (see below), whose sum is σ = 106483123584000. Its totient is φ = 99820777867200.
The previous prime is 103122203213069. The next prime is 103122203213131. The reversal of 103122203213101 is 101312302221301.
It is a cyclic number.
It is not a de Polignac number, because 103122203213101 - 25 = 103122203213069 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103122203213131) 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 15 ways as a sum of consecutive naturals, for example, 32521101 + ... + 35550898.
It is an arithmetic number, because the mean of its divisors is an integer number (6655195224000).
Almost surely, 2103122203213101 is an apocalyptic number.
It is an amenable number.
103122203213101 is a deficient number, since it is larger than the sum of its proper divisors (3360920370899).
103122203213101 is a wasteful number, since it uses less digits than its factorization.
103122203213101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68072436.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 103122203213101 its reverse (101312302221301), we get a palindrome (204434505434402).
The spelling of 103122203213101 in words is "one hundred three trillion, one hundred twenty-two billion, two hundred three million, two hundred thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •