Base | Representation |
---|---|
bin | 1010100111111011110111… |
… | …10011111101001011100011 |
3 | 10001201102110010102202122112 |
4 | 11103331323303331023203 |
5 | 11030232201002343301 |
6 | 121404312420225535 |
7 | 4630610105241101 |
oct | 523757363751343 |
9 | 101642403382575 |
10 | 23362404340451 |
11 | 7497a382146a0 |
12 | 2753959b3b2ab |
13 | 10060b0547b77 |
14 | 5aaa641b8c71 |
15 | 2a7a9a61d9bb |
hex | 153f7bcfd2e3 |
23362404340451 has 16 divisors (see below), whose sum is σ = 26377028764128. Its totient is φ = 20506922188800.
The previous prime is 23362404340411. The next prime is 23362404340481. The reversal of 23362404340451 is 15404340426332.
It is a cyclic number.
It is not a de Polignac number, because 23362404340451 - 226 = 23362337231587 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (41).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23362404340399 and 23362404340408.
It is not an unprimeable number, because it can be changed into a prime (23362404340411) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 266973470 + ... + 267060963.
It is an arithmetic number, because the mean of its divisors is an integer number (1648564297758).
Almost surely, 223362404340451 is an apocalyptic number.
23362404340451 is a deficient number, since it is larger than the sum of its proper divisors (3014624423677).
23362404340451 is a wasteful number, since it uses less digits than its factorization.
23362404340451 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 534034582.
The product of its (nonzero) digits is 829440, while the sum is 41.
Adding to 23362404340451 its reverse (15404340426332), we get a palindrome (38766744766783).
The spelling of 23362404340451 in words is "twenty-three trillion, three hundred sixty-two billion, four hundred four million, three hundred forty thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •