Base | Representation |
---|---|
bin | 10101101101011001… |
… | …110001111100100010 |
3 | 2020011112110111112100 |
4 | 111231121301330202 |
5 | 340214414424302 |
6 | 14413020511230 |
7 | 1453436242653 |
oct | 255531617442 |
9 | 66145414470 |
10 | 23310311202 |
11 | 9982076902 |
12 | 46266ab516 |
13 | 227645a369 |
14 | 11b1bc752a |
15 | 9166a8d1c |
hex | 56d671f22 |
23310311202 has 12 divisors (see below), whose sum is σ = 50505674310. Its totient is φ = 7770103728.
The previous prime is 23310311191. The next prime is 23310311267. The reversal of 23310311202 is 20211301332.
23310311202 is a `hidden beast` number, since 2 + 331 + 0 + 311 + 20 + 2 = 666.
It can be written as a sum of positive squares in only one way, i.e., 23022296361 + 288014841 = 151731^2 + 16971^2 .
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 1295017289 = 23310311202 / (2 + 3 + 3 + 1 + 0 + 3 + 1 + 1 + 2 + 0 + 2).
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 5 ways as a sum of consecutive naturals, for example, 647508627 + ... + 647508662.
Almost surely, 223310311202 is an apocalyptic number.
23310311202 is an abundant number, since it is smaller than the sum of its proper divisors (27195363108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23310311202 is a wasteful number, since it uses less digits than its factorization.
23310311202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1295017297 (or 1295017294 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 23310311202 its reverse (20211301332), we get a palindrome (43521612534).
The spelling of 23310311202 in words is "twenty-three billion, three hundred ten million, three hundred eleven thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •