Base | Representation |
---|---|
bin | 111100010100111… |
… | …1000001111101001 |
3 | 12020001222021000110 |
4 | 1320221320033221 |
5 | 13121201303301 |
6 | 532510324533 |
7 | 101106535410 |
oct | 17051701751 |
9 | 5201867013 |
10 | 2024244201 |
11 | 9496a66a1 |
12 | 485ab9749 |
13 | 2634b5545 |
14 | 152baa477 |
15 | bcaa10d6 |
hex | 78a783e9 |
2024244201 has 16 divisors (see below), whose sum is σ = 3091902848. Its totient is φ = 1153958400.
The previous prime is 2024244197. The next prime is 2024244203. The reversal of 2024244201 is 1024424202.
It is not a de Polignac number, because 2024244201 - 22 = 2024244197 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2024244203) 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 15 ways as a sum of consecutive naturals, for example, 105640 + ... + 123321.
It is an arithmetic number, because the mean of its divisors is an integer number (193243928).
Almost surely, 22024244201 is an apocalyptic number.
2024244201 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2024244201 is a deficient number, since it is larger than the sum of its proper divisors (1067658647).
2024244201 is a wasteful number, since it uses less digits than its factorization.
2024244201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 229392.
The product of its (nonzero) digits is 1024, while the sum is 21.
The square root of 2024244201 is about 44991.6014496039. The cubic root of 2024244201 is about 1264.9915794614.
Adding to 2024244201 its reverse (1024424202), we get a palindrome (3048668403).
The spelling of 2024244201 in words is "two billion, twenty-four million, two hundred forty-four thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •