Base | Representation |
---|---|
bin | 1010011110101001100000… |
… | …10111111010111010000000 |
3 | 10000120220210222020122100102 |
4 | 11033110300113322322000 |
5 | 11010020200121320000 |
6 | 121001541225141532 |
7 | 4565552505514613 |
oct | 517246027727200 |
9 | 100526728218312 |
10 | 23043311120000 |
11 | 7384682431266 |
12 | 2701b4632a8a8 |
13 | cb1c89b6caa2 |
14 | 59943339417a |
15 | 29e621b0e3d5 |
hex | 14f5305fae80 |
23043311120000 has 80 divisors (see below), whose sum is σ = 57364883025450. Its totient is φ = 9217324416000.
The previous prime is 23043311119957. The next prime is 23043311120069. The reversal of 23043311120000 is 2111334032.
It can be written as a sum of positive squares in 5 ways, for example, as 4222498936384 + 18820812183616 = 2054872^2 + 4338296^2 .
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 143940695 + ... + 144100694.
Almost surely, 223043311120000 is an apocalyptic number.
23043311120000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
23043311120000 is an abundant number, since it is smaller than the sum of its proper divisors (34321571905450).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23043311120000 is an frugal number, since it uses more digits than its factorization.
23043311120000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 288041423 (or 288041396 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 23043311120000 its reverse (2111334032), we get a palindrome (23045422454032).
The spelling of 23043311120000 in words is "twenty-three trillion, forty-three billion, three hundred eleven million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •