Base | Representation |
---|---|
bin | 10101100001100110… |
… | …110100111000010101 |
3 | 2012122202001210120112 |
4 | 111201212310320111 |
5 | 334313233421001 |
6 | 14341231012405 |
7 | 1445514124334 |
oct | 254146647025 |
9 | 65582053515 |
10 | 23112404501 |
11 | 989039364a |
12 | 459036a105 |
13 | 2244456ac4 |
14 | 11937cbd1b |
15 | 904114cbb |
hex | 5619b4e15 |
23112404501 has 4 divisors (see below), whose sum is σ = 23114095404. Its totient is φ = 23110713600.
The previous prime is 23112404453. The next prime is 23112404509. The reversal of 23112404501 is 10540421132.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4391050225 + 18721354276 = 66265^2 + 136826^2 .
It is a cyclic number.
It is not a de Polignac number, because 23112404501 - 26 = 23112404437 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23112404509) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 824780 + ... + 852341.
It is an arithmetic number, because the mean of its divisors is an integer number (5778523851).
Almost surely, 223112404501 is an apocalyptic number.
It is an amenable number.
23112404501 is a deficient number, since it is larger than the sum of its proper divisors (1690903).
23112404501 is a wasteful number, since it uses less digits than its factorization.
23112404501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1690902.
The product of its (nonzero) digits is 960, while the sum is 23.
Adding to 23112404501 its reverse (10540421132), we get a palindrome (33652825633).
The spelling of 23112404501 in words is "twenty-three billion, one hundred twelve million, four hundred four thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •