Base | Representation |
---|---|
bin | 1010100000101110000001… |
… | …01100111000100011011111 |
3 | 10000211201102220101100202210 |
4 | 11100113000230320203133 |
5 | 11012201344203324411 |
6 | 121054344353251503 |
7 | 4603651445230020 |
oct | 520270054704337 |
9 | 100751386340683 |
10 | 23114452011231 |
11 | 7401869627849 |
12 | 271389b263b93 |
13 | cb88b67844b9 |
14 | 59ca61710c47 |
15 | 2a13d7481ca6 |
hex | 1505c0b388df |
23114452011231 has 16 divisors (see below), whose sum is σ = 35222386304000. Its totient is φ = 13208121720288.
The previous prime is 23114452011151. The next prime is 23114452011263. The reversal of 23114452011231 is 13211025441132.
It is not a de Polignac number, because 23114452011231 - 29 = 23114452010719 is a prime.
It is a super-2 number, since 2×231144520112312 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23114452011731) 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, 3593191 + ... + 7690248.
It is an arithmetic number, because the mean of its divisors is an integer number (2201399144000).
Almost surely, 223114452011231 is an apocalyptic number.
23114452011231 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
23114452011231 is a deficient number, since it is larger than the sum of its proper divisors (12107934292769).
23114452011231 is a wasteful number, since it uses less digits than its factorization.
23114452011231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11380998.
The product of its (nonzero) digits is 5760, while the sum is 30.
Adding to 23114452011231 its reverse (13211025441132), we get a palindrome (36325477452363).
The spelling of 23114452011231 in words is "twenty-three trillion, one hundred fourteen billion, four hundred fifty-two million, eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •