Base | Representation |
---|---|
bin | 11101011101000000100… |
… | …100111100101101111001 |
3 | 21011111022221120212101211 |
4 | 131131000210330231321 |
5 | 231130134313232441 |
6 | 4145452503243121 |
7 | 266141633561524 |
oct | 35350044745571 |
9 | 7144287525354 |
10 | 2024013024121 |
11 | 71041964a270 |
12 | 288325a494a1 |
13 | 118b2c47089a |
14 | 6dd69b19bbb |
15 | 379b11e2a81 |
hex | 1d74093cb79 |
2024013024121 has 8 divisors (see below), whose sum is σ = 2208025521504. Its totient is φ = 1840002412320.
The previous prime is 2024013024107. The next prime is 2024013024151. The reversal of 2024013024121 is 1214203104202.
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 2024013024121 - 237 = 1886574070649 is a prime.
It is a super-2 number, since 2×20240130241212 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2024013024092 and 2024013024101.
It is not an unprimeable number, because it can be changed into a prime (2024013024151) 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, 2701725 + ... + 3368581.
It is an arithmetic number, because the mean of its divisors is an integer number (276003190188).
Almost surely, 22024013024121 is an apocalyptic number.
It is an amenable number.
2024013024121 is a deficient number, since it is larger than the sum of its proper divisors (184012497383).
2024013024121 is a wasteful number, since it uses less digits than its factorization.
2024013024121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 942791.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 2024013024121 its reverse (1214203104202), we get a palindrome (3238216128323).
The spelling of 2024013024121 in words is "two trillion, twenty-four billion, thirteen million, twenty-four thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •