Base | Representation |
---|---|
bin | 111010100010101110101… |
… | …011011100100111011001 |
3 | 112020121010011220120121210 |
4 | 322202232223130213121 |
5 | 1011403121110422131 |
6 | 12320052212453333 |
7 | 563440120620510 |
oct | 72425653344731 |
9 | 15217104816553 |
10 | 4023020014041 |
11 | 1311175a10966 |
12 | 54b83131a249 |
13 | 2324a5074512 |
14 | dca0275b677 |
15 | 6e9abe20146 |
hex | 3a8aeadc9d9 |
4023020014041 has 32 divisors (see below), whose sum is σ = 6238585267200. Its totient is φ = 2258322252480.
The previous prime is 4023020014037. The next prime is 4023020014061. The reversal of 4023020014041 is 1404100203204.
It is not a de Polignac number, because 4023020014041 - 22 = 4023020014037 is a prime.
It is a super-3 number, since 3×40230200140413 (a number of 39 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 4023020013999 and 4023020014017.
It is not an unprimeable number, because it can be changed into a prime (4023020014061) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 634426 + ... + 2906636.
It is an arithmetic number, because the mean of its divisors is an integer number (194955789600).
Almost surely, 24023020014041 is an apocalyptic number.
It is an amenable number.
4023020014041 is a deficient number, since it is larger than the sum of its proper divisors (2215565253159).
4023020014041 is a wasteful number, since it uses less digits than its factorization.
4023020014041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2273709.
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 4023020014041 its reverse (1404100203204), we get a palindrome (5427120217245).
The spelling of 4023020014041 in words is "four trillion, twenty-three billion, twenty million, fourteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •