Base | Representation |
---|---|
bin | 11110000000011010010… |
… | …10100001001101100011 |
3 | 10122120020001212200112002 |
4 | 33000031022201031203 |
5 | 113343003312343243 |
6 | 2105350230554215 |
7 | 134326315002410 |
oct | 17001512411543 |
9 | 3576201780462 |
10 | 1031013012323 |
11 | 368282a70098 |
12 | 14799820896b |
13 | 762bb4a57c8 |
14 | 37c89229107 |
15 | 1bc44291eb8 |
hex | f00d2a1363 |
1031013012323 has 8 divisors (see below), whose sum is σ = 1178316592992. Its totient is φ = 883713433536.
The previous prime is 1031013012247. The next prime is 1031013012361. The reversal of 1031013012323 is 3232103101301.
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 1031013012323 - 210 = 1031013011299 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1031013012295 and 1031013012304.
It is not an unprimeable number, because it can be changed into a prime (1031013012373) 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 7 ways as a sum of consecutive naturals, for example, 426440 + ... + 1497957.
It is an arithmetic number, because the mean of its divisors is an integer number (147289574124).
Almost surely, 21031013012323 is an apocalyptic number.
1031013012323 is a deficient number, since it is larger than the sum of its proper divisors (147303580669).
1031013012323 is an equidigital number, since it uses as much as digits as its factorization.
1031013012323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2000941.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 1031013012323 its reverse (3232103101301), we get a palindrome (4263116113624).
The spelling of 1031013012323 in words is "one trillion, thirty-one billion, thirteen million, twelve thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •