Base | Representation |
---|---|
bin | 11010000010010001011010… |
… | …111101101001001011000111 |
3 | 120000102121100000100202122202 |
4 | 122002101122331221023013 |
5 | 110002023431140021411 |
6 | 1043311011124345115 |
7 | 33055511264522012 |
oct | 3202213275511307 |
9 | 500377300322582 |
10 | 114505354220231 |
11 | 335374a2344157 |
12 | 10a13aa354519b |
13 | 4bb7a685795c0 |
14 | 203c135610379 |
15 | d388313c683b |
hex | 68245af692c7 |
114505354220231 has 16 divisors (see below), whose sum is σ = 123412101120000. Its totient is φ = 105612730862688.
The previous prime is 114505354220207. The next prime is 114505354220239. The reversal of 114505354220231 is 132022453505411.
It is a cyclic number.
It is not a de Polignac number, because 114505354220231 - 26 = 114505354220167 is a prime.
It is a super-2 number, since 2×1145053542202312 (a number of 29 digits) contains 22 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 (114505354220239) 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 15 ways as a sum of consecutive naturals, for example, 86320250 + ... + 87636728.
It is an arithmetic number, because the mean of its divisors is an integer number (7713256320000).
Almost surely, 2114505354220231 is an apocalyptic number.
114505354220231 is a deficient number, since it is larger than the sum of its proper divisors (8906746899769).
114505354220231 is a wasteful number, since it uses less digits than its factorization.
114505354220231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1321838.
The product of its (nonzero) digits is 144000, while the sum is 38.
The spelling of 114505354220231 in words is "one hundred fourteen trillion, five hundred five billion, three hundred fifty-four million, two hundred twenty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •