Base | Representation |
---|---|
bin | 11110000000011010001… |
… | …10101101000100100011 |
3 | 10122120012222222212210001 |
4 | 33000031012231010203 |
5 | 113343003033343243 |
6 | 2105350153320431 |
7 | 134326303336066 |
oct | 17001506550443 |
9 | 3576188885701 |
10 | 1031012012323 |
11 | 368282447847 |
12 | 147997a06117 |
13 | 762bb2155a7 |
14 | 37c890488dd |
15 | 1bc44145a4d |
hex | f00d1ad123 |
1031012012323 has 4 divisors (see below), whose sum is σ = 1031014656688. Its totient is φ = 1031009367960.
The previous prime is 1031012012213. The next prime is 1031012012333. The reversal of 1031012012323 is 3232102101301.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1031012012323 - 213 = 1031012004131 is a prime.
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 1031012012323.
It is not an unprimeable number, because it can be changed into a prime (1031012012333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 609183 + ... + 1559848.
It is an arithmetic number, because the mean of its divisors is an integer number (257753664172).
Almost surely, 21031012012323 is an apocalyptic number.
1031012012323 is a deficient number, since it is larger than the sum of its proper divisors (2644365).
1031012012323 is an equidigital number, since it uses as much as digits as its factorization.
1031012012323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2644364.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 1031012012323 its reverse (3232102101301), we get a palindrome (4263114113624).
The spelling of 1031012012323 in words is "one trillion, thirty-one billion, twelve million, twelve thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •