Base | Representation |
---|---|
bin | 10100100011001111011… |
… | …101111101110011100011 |
3 | 12000000012201220210011010 |
4 | 110203033131331303203 |
5 | 141114221340342011 |
6 | 3000434114152003 |
7 | 204013243020051 |
oct | 24431735756343 |
9 | 5000181823133 |
10 | 1412230012131 |
11 | 4a4a18030434 |
12 | 1a9848b82603 |
13 | a3232603343 |
14 | 4c4d09bd1d1 |
15 | 26b06bb71a6 |
hex | 148cf77dce3 |
1412230012131 has 8 divisors (see below), whose sum is σ = 1889626966720. Its totient is φ = 938159866152.
The previous prime is 1412230012111. The next prime is 1412230012147. The reversal of 1412230012131 is 1312100322141.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1412230012131 - 25 = 1412230012099 is a prime.
It is a super-2 number, since 2×14122300121312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1412230012098 and 1412230012107.
It is not an unprimeable number, because it can be changed into a prime (1412230012111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 831701161 + ... + 831702858.
It is an arithmetic number, because the mean of its divisors is an integer number (236203370840).
Almost surely, 21412230012131 is an apocalyptic number.
1412230012131 is a deficient number, since it is larger than the sum of its proper divisors (477396954589).
1412230012131 is a wasteful number, since it uses less digits than its factorization.
1412230012131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1663404305.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 1412230012131 its reverse (1312100322141), we get a palindrome (2724330334272).
The spelling of 1412230012131 in words is "one trillion, four hundred twelve billion, two hundred thirty million, twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •