Base | Representation |
---|---|
bin | 10111001100001011… |
… | …00001101111111111 |
3 | 1012010200010210202222 |
4 | 23212011201233333 |
5 | 200444214040411 |
6 | 5415225435555 |
7 | 620345320451 |
oct | 134605415777 |
9 | 35120123688 |
10 | 12450143231 |
11 | 5309865979 |
12 | 24b563bbbb |
13 | 12354b1776 |
14 | 8617162d1 |
15 | 4cd03b4db |
hex | 2e6161bff |
12450143231 has 8 divisors (see below), whose sum is σ = 12577478784. Its totient is φ = 12322932120.
The previous prime is 12450143227. The next prime is 12450143257. The reversal of 12450143231 is 13234105421.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12450143231 - 22 = 12450143227 is a prime.
It is a super-2 number, since 2×124501432312 (a number of 21 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 12450143231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12450143201) 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, 177080 + ... + 237186.
It is an arithmetic number, because the mean of its divisors is an integer number (1572184848).
Almost surely, 212450143231 is an apocalyptic number.
12450143231 is a deficient number, since it is larger than the sum of its proper divisors (127335553).
12450143231 is a wasteful number, since it uses less digits than its factorization.
12450143231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62221.
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 12450143231 its reverse (13234105421), we get a palindrome (25684248652).
The spelling of 12450143231 in words is "twelve billion, four hundred fifty million, one hundred forty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •