Base | Representation |
---|---|
bin | 1010100110011100001010… |
… | …01101100001110001010000 |
3 | 10001112111211020022100001201 |
4 | 11103032011031201301100 |
5 | 11023411433220300222 |
6 | 121324534051440544 |
7 | 4624110603230530 |
oct | 523160515416120 |
9 | 101474736270051 |
10 | 23311022431312 |
11 | 7478170499880 |
12 | 27459ba2b6154 |
13 | 10012b23c1b35 |
14 | 5a838c1254c0 |
15 | 2a658e7a9427 |
hex | 153385361c50 |
23311022431312 has 40 divisors (see below), whose sum is σ = 56309742499392. Its totient is φ = 9082216531200.
The previous prime is 23311022431259. The next prime is 23311022431321. The reversal of 23311022431312 is 21313422011332.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9460640989 + ... + 9460643452.
Almost surely, 223311022431312 is an apocalyptic number.
23311022431312 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
23311022431312 is an abundant number, since it is smaller than the sum of its proper divisors (32998720068080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23311022431312 is a wasteful number, since it uses less digits than its factorization.
23311022431312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18921284467 (or 18921284461 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 23311022431312 its reverse (21313422011332), we get a palindrome (44624444442644).
The spelling of 23311022431312 in words is "twenty-three trillion, three hundred eleven billion, twenty-two million, four hundred thirty-one thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •