Base | Representation |
---|---|
bin | 10101110011000111… |
… | …001100111100111000 |
3 | 2020102012201022001200 |
4 | 111303013030330320 |
5 | 340413430320001 |
6 | 14430322014200 |
7 | 1456011414234 |
oct | 256307147470 |
9 | 66365638050 |
10 | 23406104376 |
11 | 9a21154716 |
12 | 46527a7360 |
13 | 229025a105 |
14 | 11c08015c4 |
15 | 91eccc086 |
hex | 5731ccf38 |
23406104376 has 72 divisors (see below), whose sum is σ = 66267626880. Its totient is φ = 7462803744.
The previous prime is 23406104329. The next prime is 23406104377. The reversal of 23406104376 is 67340160432.
It is a happy number.
23406104376 is a `hidden beast` number, since 2 + 3 + 4 + 0 + 610 + 4 + 37 + 6 = 666.
It is a tau number, because it is divible by the number of its divisors (72).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 23406104376.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23406104377) by changing a digit.
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 17 ways as a sum of consecutive naturals, for example, 269176 + ... + 345351.
Almost surely, 223406104376 is an apocalyptic number.
It is an amenable number.
23406104376 is an abundant number, since it is smaller than the sum of its proper divisors (42861522504).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23406104376 is a wasteful number, since it uses less digits than its factorization.
23406104376 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 614585 (or 614555 counting only the distinct ones).
The product of its (nonzero) digits is 72576, while the sum is 36.
The spelling of 23406104376 in words is "twenty-three billion, four hundred six million, one hundred four thousand, three hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •