Base | Representation |
---|---|
bin | 111010100011101011101… |
… | …110011010100000010001 |
3 | 112020200202120002201101012 |
4 | 322203223232122200101 |
5 | 1011412220303431001 |
6 | 12320342000420305 |
7 | 563504365232315 |
oct | 72435356324021 |
9 | 15220676081335 |
10 | 4024044202001 |
11 | 131165105549a |
12 | 54ba78317695 |
13 | 2326093000b5 |
14 | dca9c7a3b45 |
15 | 6ea1bccd2bb |
hex | 3a8ebb9a811 |
4024044202001 has 16 divisors (see below), whose sum is σ = 4159121250816. Its totient is φ = 3890846400000.
The previous prime is 4024044201889. The next prime is 4024044202027. The reversal of 4024044202001 is 1002024404204.
4024044202001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 4024044202001 - 218 = 4024043939857 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4024044202051) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1914281 + ... + 3422361.
It is an arithmetic number, because the mean of its divisors is an integer number (259945078176).
Almost surely, 24024044202001 is an apocalyptic number.
4024044202001 is a gapful number since it is divisible by the number (41) formed by its first and last digit.
It is an amenable number.
4024044202001 is a deficient number, since it is larger than the sum of its proper divisors (135077048815).
4024044202001 is a wasteful number, since it uses less digits than its factorization.
4024044202001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1508704.
The product of its (nonzero) digits is 2048, while the sum is 23.
Adding to 4024044202001 its reverse (1002024404204), we get a palindrome (5026068606205).
The spelling of 4024044202001 in words is "four trillion, twenty-four billion, forty-four million, two hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •