Base | Representation |
---|---|
bin | 111010011000100101101… |
… | …010101100100111000111 |
3 | 112012120000100001212222222 |
4 | 322120211222230213013 |
5 | 1011213321114413411 |
6 | 12311051524042555 |
7 | 562603233146426 |
oct | 72304552544707 |
9 | 15176010055888 |
10 | 4012131404231 |
11 | 1307598644185 |
12 | 5496b283345b |
13 | 23145b24ac32 |
14 | dc28c5a52bd |
15 | 6e5710354db |
hex | 3a625aac9c7 |
4012131404231 has 16 divisors (see below), whose sum is σ = 4299104943840. Its totient is φ = 3732929608320.
The previous prime is 4012131404213. The next prime is 4012131404287. The reversal of 4012131404231 is 1324041312104.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4012131404231 is a prime.
It is a super-2 number, since 2×40121314042312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4012131404231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4012131404431) 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, 1893800 + ... + 3407453.
It is an arithmetic number, because the mean of its divisors is an integer number (268694058990).
Almost surely, 24012131404231 is an apocalyptic number.
4012131404231 is a deficient number, since it is larger than the sum of its proper divisors (286973539609).
4012131404231 is a wasteful number, since it uses less digits than its factorization.
4012131404231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5301986.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 4012131404231 its reverse (1324041312104), we get a palindrome (5336172716335).
The spelling of 4012131404231 in words is "four trillion, twelve billion, one hundred thirty-one million, four hundred four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •