Base | Representation |
---|---|
bin | 10000100000001000011… |
… | …010000000011010010111 |
3 | 11000102002021101202221112 |
4 | 100200020122000122113 |
5 | 122034424133320203 |
6 | 2224542541205235 |
7 | 144633612240245 |
oct | 20401032003227 |
9 | 4012067352845 |
10 | 1134012401303 |
11 | 3a7a28489561 |
12 | 16394256081b |
13 | 82c24514612 |
14 | 3cc5a773795 |
15 | 1e77199e6d8 |
hex | 10808680697 |
1134012401303 has 16 divisors (see below), whose sum is σ = 1204917327360. Its totient is φ = 1065232224000.
The previous prime is 1134012401267. The next prime is 1134012401339. The reversal of 1134012401303 is 3031042104311.
It is an interprime number because it is at equal distance from previous prime (1134012401267) and next prime (1134012401339).
It is a cyclic number.
It is not a de Polignac number, because 1134012401303 - 26 = 1134012401239 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1134012401383) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16652243 + ... + 16720203.
It is an arithmetic number, because the mean of its divisors is an integer number (75307332960).
Almost surely, 21134012401303 is an apocalyptic number.
1134012401303 is a deficient number, since it is larger than the sum of its proper divisors (70904926057).
1134012401303 is a wasteful number, since it uses less digits than its factorization.
1134012401303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83578.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 1134012401303 its reverse (3031042104311), we get a palindrome (4165054505614).
The spelling of 1134012401303 in words is "one trillion, one hundred thirty-four billion, twelve million, four hundred one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •