Base | Representation |
---|---|
bin | 10110111101111011000100… |
… | …000111101100110101011001 |
3 | 111020122200111001002211222012 |
4 | 112331323010013230311121 |
5 | 101214441223243022223 |
6 | 554500231354035305 |
7 | 30163620506425022 |
oct | 2675730407546531 |
9 | 436580431084865 |
10 | 101012331220313 |
11 | 2a2050a8651437 |
12 | b3b4a49418b35 |
13 | 4449564085646 |
14 | 1ad3046c55c49 |
15 | ba28688d0c78 |
hex | 5bdec41ecd59 |
101012331220313 has 16 divisors (see below), whose sum is σ = 107446737378960. Its totient is φ = 94633328111616.
The previous prime is 101012331220303. The next prime is 101012331220321. The reversal of 101012331220313 is 313022133210101.
It can be written as a sum of positive squares in 8 ways, for example, as 20576312076544 + 80436019143769 = 4536112^2 + 8968613^2 .
It is a cyclic number.
It is not a de Polignac number, because 101012331220313 - 232 = 101008036253017 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101012331220303) 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, 5878406 + ... + 15381167.
It is an arithmetic number, because the mean of its divisors is an integer number (6715421086185).
Almost surely, 2101012331220313 is an apocalyptic number.
It is an amenable number.
101012331220313 is a deficient number, since it is larger than the sum of its proper divisors (6434406158647).
101012331220313 is a wasteful number, since it uses less digits than its factorization.
101012331220313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21260876.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 101012331220313 its reverse (313022133210101), we get a palindrome (414034464430414).
The spelling of 101012331220313 in words is "one hundred one trillion, twelve billion, three hundred thirty-one million, two hundred twenty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •