Base | Representation |
---|---|
bin | 11101011101001111100… |
… | …01010101100111010111 |
3 | 10120202111020000002002020 |
4 | 32232213301111213113 |
5 | 113040321300340343 |
6 | 2052544514144223 |
7 | 133060401263310 |
oct | 16564761254727 |
9 | 3522436002066 |
10 | 1012132043223 |
11 | 3602741745a4 |
12 | 1441a8b82073 |
13 | 7459c8b2b42 |
14 | 36db77d7607 |
15 | 1b4db8bab83 |
hex | eba7c559d7 |
1012132043223 has 8 divisors (see below), whose sum is σ = 1542296446848. Its totient is φ = 578361167544.
The previous prime is 1012132043213. The next prime is 1012132043287. The reversal of 1012132043223 is 3223402312101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1012132043223 - 210 = 1012132042199 is a prime.
It is a super-2 number, since 2×10121320432232 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1012132043193 and 1012132043202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012132043213) 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, 24098381961 + ... + 24098382002.
It is an arithmetic number, because the mean of its divisors is an integer number (192787055856).
Almost surely, 21012132043223 is an apocalyptic number.
1012132043223 is a deficient number, since it is larger than the sum of its proper divisors (530164403625).
1012132043223 is an equidigital number, since it uses as much as digits as its factorization.
1012132043223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48196763973.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 1012132043223 its reverse (3223402312101), we get a palindrome (4235534355324).
The spelling of 1012132043223 in words is "one trillion, twelve billion, one hundred thirty-two million, forty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •