Base | Representation |
---|---|
bin | 1011000000011000110111… |
… | …0111100010101001000101 |
3 | 1120211212120121120201120220 |
4 | 2300012031313202221011 |
5 | 3041231432033120401 |
6 | 41423132321214553 |
7 | 2356201366330311 |
oct | 260061567425105 |
9 | 46755517521526 |
10 | 12101303020101 |
11 | 3946152090219 |
12 | 1435391a91459 |
13 | 69a1c0153b29 |
14 | 2db9c5b08b41 |
15 | 15ebb1745336 |
hex | b018dde2a45 |
12101303020101 has 8 divisors (see below), whose sum is σ = 16193320047264. Its totient is φ = 8038410669840.
The previous prime is 12101303020099. The next prime is 12101303020139. The reversal of 12101303020101 is 10102030310121.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12101303020101 - 21 = 12101303020099 is a prime.
It is a super-2 number, since 2×121013030201012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12101301020101) 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, 7281168255 + ... + 7281169916.
It is an arithmetic number, because the mean of its divisors is an integer number (2024165005908).
Almost surely, 212101303020101 is an apocalyptic number.
It is an amenable number.
12101303020101 is a deficient number, since it is larger than the sum of its proper divisors (4092017027163).
12101303020101 is a wasteful number, since it uses less digits than its factorization.
12101303020101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14562338451.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 12101303020101 its reverse (10102030310121), we get a palindrome (22203333330222).
The spelling of 12101303020101 in words is "twelve trillion, one hundred one billion, three hundred three million, twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •