Base | Representation |
---|---|
bin | 10101011100000111… |
… | …100001001101101010 |
3 | 2012102022202222121000 |
4 | 111130013201031222 |
5 | 334121144431102 |
6 | 14324141055430 |
7 | 1443315263334 |
oct | 253407411552 |
9 | 65368688530 |
10 | 23020311402 |
11 | 9843402750 |
12 | 4565557576 |
13 | 222b35124a |
14 | 1185498454 |
15 | 8eaec301c |
hex | 55c1e136a |
23020311402 has 64 divisors (see below), whose sum is σ = 55828454400. Its totient is φ = 6973147440.
The previous prime is 23020311401. The next prime is 23020311427. The reversal of 23020311402 is 20411302032.
23020311402 is a `hidden beast` number, since 230 + 2 + 0 + 31 + 1 + 402 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (23020311401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1958499 + ... + 1970217.
It is an arithmetic number, because the mean of its divisors is an integer number (872319600).
Almost surely, 223020311402 is an apocalyptic number.
23020311402 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
23020311402 is an abundant number, since it is smaller than the sum of its proper divisors (32808142998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23020311402 is a wasteful number, since it uses less digits than its factorization.
23020311402 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15048 (or 15042 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 23020311402 its reverse (20411302032), we get a palindrome (43431613434).
The spelling of 23020311402 in words is "twenty-three billion, twenty million, three hundred eleven thousand, four hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •