Base | Representation |
---|---|
bin | 111010101110101101… |
… | …0010101011110111101 |
3 | 110001112121100122021012 |
4 | 1311131122111132331 |
5 | 4031244014031123 |
6 | 133534515445005 |
7 | 12053254551464 |
oct | 1653532253675 |
9 | 401477318235 |
10 | 126121236413 |
11 | 49540171697 |
12 | 205398b6765 |
13 | bb7c420a53 |
14 | 61662b39db |
15 | 343258a378 |
hex | 1d5d6957bd |
126121236413 has 8 divisors (see below), whose sum is σ = 128982247680. Its totient is φ = 123291838800.
The previous prime is 126121236407. The next prime is 126121236419. The reversal of 126121236413 is 314632121621.
It is an interprime number because it is at equal distance from previous prime (126121236407) and next prime (126121236419).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 126121236413 - 210 = 126121235389 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 126121236413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (126121236419) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7895345 + ... + 7911302.
It is an arithmetic number, because the mean of its divisors is an integer number (16122780960).
Almost surely, 2126121236413 is an apocalyptic number.
It is an amenable number.
126121236413 is a deficient number, since it is larger than the sum of its proper divisors (2861011267).
126121236413 is a wasteful number, since it uses less digits than its factorization.
126121236413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15806827.
The product of its digits is 10368, while the sum is 32.
The spelling of 126121236413 in words is "one hundred twenty-six billion, one hundred twenty-one million, two hundred thirty-six thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •