Base | Representation |
---|---|
bin | 1001001101110001110110… |
… | …0001101001101101000111 |
3 | 1022212122022000200220022220 |
4 | 2103130131201221231013 |
5 | 2312001444220241403 |
6 | 33314420334423423 |
7 | 2064015262160631 |
oct | 223343541515507 |
9 | 38778260626286 |
10 | 10132323212103 |
11 | 3257104338854 |
12 | 1177866661b73 |
13 | 586621441671 |
14 | 27059ad89a51 |
15 | 128871c10953 |
hex | 9371d869b47 |
10132323212103 has 32 divisors (see below), whose sum is σ = 13831883181312. Its totient is φ = 6595688736000.
The previous prime is 10132323212093. The next prime is 10132323212131. The reversal of 10132323212103 is 30121232323101.
It is not a de Polignac number, because 10132323212103 - 214 = 10132323195719 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10132323212173) 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 31 ways as a sum of consecutive naturals, for example, 285472188 + ... + 285507678.
It is an arithmetic number, because the mean of its divisors is an integer number (432246349416).
Almost surely, 210132323212103 is an apocalyptic number.
10132323212103 is a deficient number, since it is larger than the sum of its proper divisors (3699559969209).
10132323212103 is a wasteful number, since it uses less digits than its factorization.
10132323212103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48575.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 10132323212103 its reverse (30121232323101), we get a palindrome (40253555535204).
It can be divided in two parts, 10132323 and 212103, that added together give a triangular number (10344426 = T4548).
The spelling of 10132323212103 in words is "ten trillion, one hundred thirty-two billion, three hundred twenty-three million, two hundred twelve thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •