Base | Representation |
---|---|
bin | 110101010111010110… |
… | …0011110111010010111 |
3 | 101221210200012112111201 |
4 | 1222232230132322113 |
5 | 3334200102434411 |
6 | 124351352413331 |
7 | 11164616214646 |
oct | 1525654367227 |
9 | 357720175451 |
10 | 114600046231 |
11 | 44668813a10 |
12 | 1a2633a7247 |
13 | aa64532258 |
14 | 57920d335d |
15 | 2eaad993c1 |
hex | 1aaeb1ee97 |
114600046231 has 16 divisors (see below), whose sum is σ = 127374290208. Its totient is φ = 102232972800.
The previous prime is 114600046181. The next prime is 114600046243. The reversal of 114600046231 is 132640006411.
It is a cyclic number.
It is not a de Polignac number, because 114600046231 - 29 = 114600045719 is a prime.
It is a super-2 number, since 2×1146000462312 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 114600046231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114600047231) 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, 204030 + ... + 520411.
It is an arithmetic number, because the mean of its divisors is an integer number (7960893138).
Almost surely, 2114600046231 is an apocalyptic number.
114600046231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
114600046231 is a deficient number, since it is larger than the sum of its proper divisors (12774243977).
114600046231 is a wasteful number, since it uses less digits than its factorization.
114600046231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 724722.
The product of its (nonzero) digits is 3456, while the sum is 28.
The spelling of 114600046231 in words is "one hundred fourteen billion, six hundred million, forty-six thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •