Base | Representation |
---|---|
bin | 10110101111010111100001… |
… | …110000010011001001011101 |
3 | 111010010001201021112011011212 |
4 | 112233113201300103021131 |
5 | 101102044240330203201 |
6 | 552412531441354205 |
7 | 30031431045136526 |
oct | 2657274160231135 |
9 | 433101637464155 |
10 | 100012101022301 |
11 | 29959991798356 |
12 | b273022338965 |
13 | 43a61401bb680 |
14 | 1a9a87c00984d |
15 | b86826d47abb |
hex | 5af5e1c1325d |
100012101022301 has 16 divisors (see below), whose sum is σ = 111288812490240. Its totient is φ = 89253159284160.
The previous prime is 100012101022291. The next prime is 100012101022319. The reversal of 100012101022301 is 103220101210001.
It is a cyclic number.
It is not a de Polignac number, because 100012101022301 - 234 = 99994921153117 is a prime.
It is a super-3 number, since 3×1000121010223013 (a number of 43 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100012101022201) 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, 121360190 + ... + 122181503.
It is an arithmetic number, because the mean of its divisors is an integer number (6955550780640).
Almost surely, 2100012101022301 is an apocalyptic number.
It is an amenable number.
100012101022301 is a deficient number, since it is larger than the sum of its proper divisors (11276711467939).
100012101022301 is a wasteful number, since it uses less digits than its factorization.
100012101022301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 243542756.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 100012101022301 its reverse (103220101210001), we get a palindrome (203232202232302).
The spelling of 100012101022301 in words is "one hundred trillion, twelve billion, one hundred one million, twenty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •