Base | Representation |
---|---|
bin | 10110111111100000011101… |
… | …010001110000101001100001 |
3 | 111021001002111101012110100120 |
4 | 112333200131101300221201 |
5 | 101223232210002241001 |
6 | 555022234415510453 |
7 | 30204523430200425 |
oct | 2677403521605141 |
9 | 437032441173316 |
10 | 101121201212001 |
11 | 2a247295950583 |
12 | b411b71828429 |
13 | 44568c4425b79 |
14 | 1ad8413d28b85 |
15 | ba55db6b6236 |
hex | 5bf81d470a61 |
101121201212001 has 32 divisors (see below), whose sum is σ = 137154305971200. Its totient is φ = 66262120243200.
The previous prime is 101121201211967. The next prime is 101121201212047. The reversal of 101121201212001 is 100212102121101.
It is a happy number.
It is not a de Polignac number, because 101121201212001 - 26 = 101121201211937 is a prime.
It is a super-2 number, since 2×1011212012120012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (101121201216001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 24830160 + ... + 28614318.
It is an arithmetic number, because the mean of its divisors is an integer number (4286072061600).
Almost surely, 2101121201212001 is an apocalyptic number.
It is an amenable number.
101121201212001 is a deficient number, since it is larger than the sum of its proper divisors (36033104759199).
101121201212001 is a wasteful number, since it uses less digits than its factorization.
101121201212001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3784889.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 101121201212001 its reverse (100212102121101), we get a palindrome (201333303333102).
The spelling of 101121201212001 in words is "one hundred one trillion, one hundred twenty-one billion, two hundred one million, two hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •