Base | Representation |
---|---|
bin | 10101110010111111… |
… | …010011011111010011 |
3 | 2020102001211010001012 |
4 | 111302333103133103 |
5 | 340412413042003 |
6 | 14430205401135 |
7 | 1455655002200 |
oct | 256277233723 |
9 | 66361733035 |
10 | 23404034003 |
11 | 9a1aa70169 |
12 | 4651b691ab |
13 | 228c9b393c |
14 | 11c0422ca7 |
15 | 91ea1d8d8 |
hex | 572fd37d3 |
23404034003 has 6 divisors (see below), whose sum is σ = 27225100836. Its totient is φ = 20060600532.
The previous prime is 23404033999. The next prime is 23404034021. The reversal of 23404034003 is 30043040432.
It is a happy number.
It is not a de Polignac number, because 23404034003 - 22 = 23404033999 is a prime.
It is a super-2 number, since 2×234040340032 (a number of 22 digits) contains 22 as substring.
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 23404034003.
It is not an unprimeable number, because it can be changed into a prime (23404034083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 238816625 + ... + 238816722.
It is an arithmetic number, because the mean of its divisors is an integer number (4537516806).
Almost surely, 223404034003 is an apocalyptic number.
23404034003 is a deficient number, since it is larger than the sum of its proper divisors (3821066833).
23404034003 is an equidigital number, since it uses as much as digits as its factorization.
23404034003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 477633361 (or 477633354 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 23.
Adding to 23404034003 its reverse (30043040432), we get a palindrome (53447074435).
The spelling of 23404034003 in words is "twenty-three billion, four hundred four million, thirty-four thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •