Base | Representation |
---|---|
bin | 10110111111100001001101… |
… | …011111000101100101100001 |
3 | 111021001011120202002202101010 |
4 | 112333201031133011211201 |
5 | 101223240334030341001 |
6 | 555022450551131133 |
7 | 30204552450655056 |
oct | 2677411537054541 |
9 | 437034522082333 |
10 | 101122010012001 |
11 | 2a247670451a30 |
12 | b412158673aa9 |
13 | 44569c2b6a354 |
14 | 1ad848d50502d |
15 | ba56376ca8d6 |
hex | 5bf84d7c5961 |
101122010012001 has 8 divisors (see below), whose sum is σ = 147086560017504. Its totient is φ = 61286066673920.
The previous prime is 101122010011987. The next prime is 101122010012047. The reversal of 101122010012001 is 100210010221101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101122010012001 - 221 = 101122007914849 is a prime.
It is not an unprimeable number, because it can be changed into a prime (101122010012201) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1532151666816 + ... + 1532151666881.
It is an arithmetic number, because the mean of its divisors is an integer number (18385820002188).
Almost surely, 2101122010012001 is an apocalyptic number.
101122010012001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101122010012001 is a deficient number, since it is larger than the sum of its proper divisors (45964550005503).
101122010012001 is a wasteful number, since it uses less digits than its factorization.
101122010012001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3064303333711.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 101122010012001 its reverse (100210010221101), we get a palindrome (201332020233102).
The spelling of 101122010012001 in words is "one hundred one trillion, one hundred twenty-two billion, ten million, twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •