Base | Representation |
---|---|
bin | 101111000101101001… |
… | …0111000010100010101 |
3 | 100200000022102201210111 |
4 | 1132023102320110111 |
5 | 3124044013330401 |
6 | 114242054523021 |
7 | 10206610162633 |
oct | 1361322702425 |
9 | 320008381714 |
10 | 101121230101 |
11 | 39981330951 |
12 | 17721366471 |
13 | 96c6bb46c8 |
14 | 4c73d28353 |
15 | 296c8b5e51 |
hex | 178b4b8515 |
101121230101 has 16 divisors (see below), whose sum is σ = 110837179440. Its totient is φ = 91828387840.
The previous prime is 101121230087. The next prime is 101121230107. The reversal of 101121230101 is 101032121101.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 3932544100 + 97188686001 = 62710^2 + 311751^2 .
It is a cyclic number.
It is not a de Polignac number, because 101121230101 - 211 = 101121228053 is a prime.
It is a super-3 number, since 3×1011212301013 (a number of 34 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 (101121230107) 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, 660885 + ... + 799381.
It is an arithmetic number, because the mean of its divisors is an integer number (6927323715).
Almost surely, 2101121230101 is an apocalyptic number.
It is an amenable number.
101121230101 is a deficient number, since it is larger than the sum of its proper divisors (9715949339).
101121230101 is a wasteful number, since it uses less digits than its factorization.
101121230101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 140024.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 101121230101 its reverse (101032121101), we get a palindrome (202153351202).
The spelling of 101121230101 in words is "one hundred one billion, one hundred twenty-one million, two hundred thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •