Base | Representation |
---|---|
bin | 111100010000000011110… |
… | …010011010110100000111 |
3 | 112122211010102200110122021 |
4 | 330100003302122310013 |
5 | 1020314030434201043 |
6 | 12450025022544011 |
7 | 605064161334604 |
oct | 74200362326407 |
9 | 15584112613567 |
10 | 4140412022023 |
11 | 1356a36711a82 |
12 | 56a533738007 |
13 | 240592b4b034 |
14 | 10457b5816ab |
15 | 72a7ce673ed |
hex | 3c403c9ad07 |
4140412022023 has 16 divisors (see below), whose sum is σ = 4420191845376. Its totient is φ = 3869245056160.
The previous prime is 4140412022017. The next prime is 4140412022027. The reversal of 4140412022023 is 3202202140414.
It is a de Polignac number, because none of the positive numbers 2k-4140412022023 is a prime.
It is a super-3 number, since 3×41404120220233 (a number of 39 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4140412022027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2792968 + ... + 4010173.
It is an arithmetic number, because the mean of its divisors is an integer number (276261990336).
Almost surely, 24140412022023 is an apocalyptic number.
4140412022023 is a deficient number, since it is larger than the sum of its proper divisors (279779823353).
4140412022023 is a wasteful number, since it uses less digits than its factorization.
4140412022023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6803774.
The product of its (nonzero) digits is 3072, while the sum is 25.
Adding to 4140412022023 its reverse (3202202140414), we get a palindrome (7342614162437).
The spelling of 4140412022023 in words is "four trillion, one hundred forty billion, four hundred twelve million, twenty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •