Base | Representation |
---|---|
bin | 1010100100011011110101… |
… | …11011010111000110000111 |
3 | 10001021221000000211120002000 |
4 | 11102031322323113012013 |
5 | 11021244340341420403 |
6 | 121233142020520343 |
7 | 4616121441626100 |
oct | 522157273270607 |
9 | 101257000746060 |
10 | 23242130420103 |
11 | 7450a28779121 |
12 | 27345925500b3 |
13 | cc795369446a |
14 | 5a4cd472b3a7 |
15 | 2a48ab5ab7a3 |
hex | 15237aed7187 |
23242130420103 has 96 divisors (see below), whose sum is σ = 43873046193600. Its totient is φ = 12068935538688.
The previous prime is 23242130420099. The next prime is 23242130420123. The reversal of 23242130420103 is 30102403124232.
23242130420103 is a `hidden beast` number, since 2 + 3 + 2 + 4 + 2 + 130 + 420 + 103 = 666.
It is not a de Polignac number, because 23242130420103 - 22 = 23242130420099 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23242130420123) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 17164950 + ... + 18469427.
It is an arithmetic number, because the mean of its divisors is an integer number (457010897850).
Almost surely, 223242130420103 is an apocalyptic number.
23242130420103 is a deficient number, since it is larger than the sum of its proper divisors (20630915773497).
23242130420103 is a wasteful number, since it uses less digits than its factorization.
23242130420103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35634446 (or 35634433 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
Adding to 23242130420103 its reverse (30102403124232), we get a palindrome (53344533544335).
The spelling of 23242130420103 in words is "twenty-three trillion, two hundred forty-two billion, one hundred thirty million, four hundred twenty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •