Base | Representation |
---|---|
bin | 10111000000110011001010… |
… | …110100000111000100001001 |
3 | 111021100120201202102000002210 |
4 | 113000303022310013010021 |
5 | 101231211101034133001 |
6 | 555131123155415333 |
7 | 30214116306465012 |
oct | 2700631264070411 |
9 | 437316652360083 |
10 | 101210012021001 |
11 | 2a280a1a278894 |
12 | b4272182b4549 |
13 | 44620a8a69820 |
14 | 1adc83ad0c009 |
15 | ba7a8843edd6 |
hex | 5c0ccad07109 |
101210012021001 has 32 divisors (see below), whose sum is σ = 148874982092928. Its totient is φ = 60762670594560.
The previous prime is 101210012020963. The next prime is 101210012021017. The reversal of 101210012021001 is 100120210012101.
It is not a de Polignac number, because 101210012021001 - 29 = 101210012020489 is a prime.
It is a super-3 number, since 3×1012100120210013 (a number of 43 digits) contains 333 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (101210012021801) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 75958810 + ... + 77279756.
It is an arithmetic number, because the mean of its divisors is an integer number (4652343190404).
Almost surely, 2101210012021001 is an apocalyptic number.
It is an amenable number.
101210012021001 is a deficient number, since it is larger than the sum of its proper divisors (47664970071927).
101210012021001 is a wasteful number, since it uses less digits than its factorization.
101210012021001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1368921.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 101210012021001 its reverse (100120210012101), we get a palindrome (201330222033102).
The spelling of 101210012021001 in words is "one hundred one trillion, two hundred ten billion, twelve million, twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •