Base | Representation |
---|---|
bin | 10111000000110011001010… |
… | …110001011110110110101101 |
3 | 111021100120201201002222222201 |
4 | 113000303022301132312231 |
5 | 101231211100400111023 |
6 | 555131123132541501 |
7 | 30214116300565213 |
oct | 2700631261366655 |
9 | 437316651088881 |
10 | 101210011332013 |
11 | 2a280a19948181 |
12 | b427218021891 |
13 | 44620a888803c |
14 | 1adc83abaccb3 |
15 | ba7a88355bad |
hex | 5c0ccac5edad |
101210011332013 has 16 divisors (see below), whose sum is σ = 103303160046576. Its totient is φ = 99123675955200.
The previous prime is 101210011331987. The next prime is 101210011332113. The reversal of 101210011332013 is 310233110012101.
It can be written as a sum of positive squares in 8 ways, for example, as 2559785604489 + 98650225727524 = 1599933^2 + 9932282^2 .
It is a cyclic number.
It is not a de Polignac number, because 101210011332013 - 29 = 101210011331501 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 (101210011332113) 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, 788956245 + ... + 789084517.
It is an arithmetic number, because the mean of its divisors is an integer number (6456447502911).
Almost surely, 2101210011332013 is an apocalyptic number.
It is an amenable number.
101210011332013 is a deficient number, since it is larger than the sum of its proper divisors (2093148714563).
101210011332013 is a wasteful number, since it uses less digits than its factorization.
101210011332013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154704.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 101210011332013 its reverse (310233110012101), we get a palindrome (411443121344114).
The spelling of 101210011332013 in words is "one hundred one trillion, two hundred ten billion, eleven million, three hundred thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •