Base | Representation |
---|---|
bin | 110101010000000010… |
… | …0001101000001111001 |
3 | 101221011120100220002020 |
4 | 1222200010031001321 |
5 | 3333144234344301 |
6 | 124311144025053 |
7 | 11155546054233 |
oct | 1524004150171 |
9 | 357146326066 |
10 | 114354606201 |
11 | 44552215210 |
12 | 1a1b5162189 |
13 | aa25728274 |
14 | 576b683253 |
15 | 2e94566436 |
hex | 1aa010d079 |
114354606201 has 8 divisors (see below), whose sum is σ = 166333972704. Its totient is φ = 69305821920.
The previous prime is 114354606193. The next prime is 114354606229. The reversal of 114354606201 is 102606453411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 114354606201 - 23 = 114354606193 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 3465291097 = 114354606201 / (1 + 1 + 4 + 3 + 5 + 4 + 6 + 0 + 6 + 2 + 0 + 1).
It is not an unprimeable number, because it can be changed into a prime (114354606241) 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, 1732645516 + ... + 1732645581.
It is an arithmetic number, because the mean of its divisors is an integer number (20791746588).
Almost surely, 2114354606201 is an apocalyptic number.
114354606201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
114354606201 is a deficient number, since it is larger than the sum of its proper divisors (51979366503).
114354606201 is a wasteful number, since it uses less digits than its factorization.
114354606201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3465291111.
The product of its (nonzero) digits is 17280, while the sum is 33.
The spelling of 114354606201 in words is "one hundred fourteen billion, three hundred fifty-four million, six hundred six thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •