Base | Representation |
---|---|
bin | 10101100111000001… |
… | …010001001000011011 |
3 | 2012220001221210211012 |
4 | 111213001101020123 |
5 | 340010011101133 |
6 | 14354233324135 |
7 | 1450666063451 |
oct | 254701211033 |
9 | 65801853735 |
10 | 23203222043 |
11 | 9927683171 |
12 | 45b686664b |
13 | 225a203bb1 |
14 | 11a18ac9d1 |
15 | 90c0a3b48 |
hex | 56705121b |
23203222043 has 8 divisors (see below), whose sum is σ = 24244662528. Its totient is φ = 22164498664.
The previous prime is 23203222013. The next prime is 23203222051. The reversal of 23203222043 is 34022230232.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 23203222043 - 214 = 23203205659 is a prime.
It is a super-2 number, since 2×232032220432 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23203222013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 661805 + ... + 695982.
It is an arithmetic number, because the mean of its divisors is an integer number (3030582816).
Almost surely, 223203222043 is an apocalyptic number.
23203222043 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
23203222043 is a deficient number, since it is larger than the sum of its proper divisors (1041440485).
23203222043 is a wasteful number, since it uses less digits than its factorization.
23203222043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1358553.
The product of its (nonzero) digits is 3456, while the sum is 23.
Adding to 23203222043 its reverse (34022230232), we get a palindrome (57225452275).
The spelling of 23203222043 in words is "twenty-three billion, two hundred three million, two hundred twenty-two thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •