Base | Representation |
---|---|
bin | 1010011101011001011010… |
… | …11100000110011101100111 |
3 | 10000102210211022012202111110 |
4 | 11032230231130012131213 |
5 | 11003314114411230203 |
6 | 120530110401240103 |
7 | 4562501115025020 |
oct | 516545534063547 |
9 | 100383738182443 |
10 | 23000312211303 |
11 | 7368417698789 |
12 | 26b5746033033 |
13 | caabc66c894b |
14 | 5973147c5c47 |
15 | 29d456bebd03 |
hex | 14eb2d706767 |
23000312211303 has 32 divisors (see below), whose sum is σ = 35149323258880. Its totient is φ = 13105119859200.
The previous prime is 23000312211277. The next prime is 23000312211353. The reversal of 23000312211303 is 30311221300032.
It is not a de Polignac number, because 23000312211303 - 25 = 23000312211271 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 23000312211303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23000312211353) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11346333 + ... + 13218921.
It is an arithmetic number, because the mean of its divisors is an integer number (1098416351840).
Almost surely, 223000312211303 is an apocalyptic number.
23000312211303 is a deficient number, since it is larger than the sum of its proper divisors (12149011047577).
23000312211303 is a wasteful number, since it uses less digits than its factorization.
23000312211303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1874287.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 23000312211303 its reverse (30311221300032), we get a palindrome (53311533511335).
The spelling of 23000312211303 in words is "twenty-three trillion, three hundred twelve million, two hundred eleven thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •