Base | Representation |
---|---|
bin | 1010101001000110001110… |
… | …01001101101110101111000 |
3 | 10001212020111010111220011112 |
4 | 11110203013021231311320 |
5 | 11031410424144313111 |
6 | 121434513452415452 |
7 | 4633522244506136 |
oct | 524430711556570 |
9 | 101766433456145 |
10 | 23402323041656 |
11 | 7502962294749 |
12 | 275b63a777588 |
13 | 1009aa2803b20 |
14 | 5ac96da62756 |
15 | 2a8b34de6e8b |
hex | 1548c726dd78 |
23402323041656 has 64 divisors (see below), whose sum is σ = 47433441753600. Its totient is φ = 10760228241408.
The previous prime is 23402323041637. The next prime is 23402323041673. The reversal of 23402323041656 is 65614032320432.
It is a super-2 number, since 2×234023230416562 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 175057016 + ... + 175190648.
It is an arithmetic number, because the mean of its divisors is an integer number (741147527400).
Almost surely, 223402323041656 is an apocalyptic number.
23402323041656 is a gapful number since it is divisible by the number (26) formed by its first and last digit.
It is an amenable number.
23402323041656 is an abundant number, since it is smaller than the sum of its proper divisors (24031118711944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23402323041656 is a wasteful number, since it uses less digits than its factorization.
23402323041656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140008 (or 140004 counting only the distinct ones).
The product of its (nonzero) digits is 622080, while the sum is 41.
The spelling of 23402323041656 in words is "twenty-three trillion, four hundred two billion, three hundred twenty-three million, forty-one thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •