Base | Representation |
---|---|
bin | 1010100001001101011100… |
… | …01110110111000111101011 |
3 | 10000220022222121021121200122 |
4 | 11100212232032313013223 |
5 | 11012440421414122311 |
6 | 121110214352153455 |
7 | 4605116503026020 |
oct | 520465616670753 |
9 | 100808877247618 |
10 | 23131322020331 |
11 | 7408a36280328 |
12 | 2717008b3888b |
13 | cba3748632c5 |
14 | 59d7c2033547 |
15 | 2a1a7352d0db |
hex | 1509ae3b71eb |
23131322020331 has 16 divisors (see below), whose sum is σ = 26708637333504. Its totient is φ = 19622221588224.
The previous prime is 23131322020291. The next prime is 23131322020337. The reversal of 23131322020331 is 13302022313132.
It is a cyclic number.
It is not a de Polignac number, because 23131322020331 - 222 = 23131317826027 is a prime.
It is a super-2 number, since 2×231313220203312 (a number of 28 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 23131322020331.
It is not an unprimeable number, because it can be changed into a prime (23131322020337) 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, 88671416 + ... + 88931898.
It is an arithmetic number, because the mean of its divisors is an integer number (1669289833344).
Almost surely, 223131322020331 is an apocalyptic number.
23131322020331 is a deficient number, since it is larger than the sum of its proper divisors (3577315313173).
23131322020331 is a wasteful number, since it uses less digits than its factorization.
23131322020331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 391370.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 23131322020331 its reverse (13302022313132), we get a palindrome (36433344333463).
The spelling of 23131322020331 in words is "twenty-three trillion, one hundred thirty-one billion, three hundred twenty-two million, twenty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •