Base | Representation |
---|---|
bin | 1010100000011011001010… |
… | …00010000011011010000010 |
3 | 10000210202022001222021221012 |
4 | 11100031211002003122002 |
5 | 11012020123433402432 |
6 | 121045551401400522 |
7 | 4603142455465616 |
oct | 520154502033202 |
9 | 100722261867835 |
10 | 23104324122242 |
11 | 73a8541702960 |
12 | 2711933499142 |
13 | cb796143a38c |
14 | 59c3805bb346 |
15 | 2a0ee3260cb2 |
hex | 150365083682 |
23104324122242 has 8 divisors (see below), whose sum is σ = 37807075836432. Its totient is φ = 10501965510100.
The previous prime is 23104324122233. The next prime is 23104324122323. The reversal of 23104324122242 is 24222142340132.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×231043241222422 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 23104324122199 and 23104324122208.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 525098275484 + ... + 525098275527.
It is an arithmetic number, because the mean of its divisors is an integer number (4725884479554).
Almost surely, 223104324122242 is an apocalyptic number.
23104324122242 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
23104324122242 is a deficient number, since it is larger than the sum of its proper divisors (14702751714190).
23104324122242 is a wasteful number, since it uses less digits than its factorization.
23104324122242 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1050196551024.
The product of its (nonzero) digits is 36864, while the sum is 32.
Adding to 23104324122242 its reverse (24222142340132), we get a palindrome (47326466462374).
The spelling of 23104324122242 in words is "twenty-three trillion, one hundred four billion, three hundred twenty-four million, one hundred twenty-two thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •