Base | Representation |
---|---|
bin | 10000100000010101011… |
… | …001001110011010001101 |
3 | 11000102122110102012011210 |
4 | 100200111121032122031 |
5 | 122040400424102201 |
6 | 2225020323405033 |
7 | 144642166323300 |
oct | 20402531163215 |
9 | 4012573365153 |
10 | 1134230300301 |
11 | 3a802a48727a |
12 | 1639a3523779 |
13 | 82c5a6c7937 |
14 | 3cc7b694b37 |
15 | 1e785b921d6 |
hex | 1081564e68d |
1134230300301 has 12 divisors (see below), whose sum is σ = 1759214343552. Its totient is φ = 648131600088.
The previous prime is 1134230300251. The next prime is 1134230300311. The reversal of 1134230300301 is 1030030324311.
It is not a de Polignac number, because 1134230300301 - 26 = 1134230300237 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1134230300311) 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 11 ways as a sum of consecutive naturals, for example, 3857926045 + ... + 3857926338.
It is an arithmetic number, because the mean of its divisors is an integer number (146601195296).
Almost surely, 21134230300301 is an apocalyptic number.
It is an amenable number.
1134230300301 is a deficient number, since it is larger than the sum of its proper divisors (624984043251).
1134230300301 is an equidigital number, since it uses as much as digits as its factorization.
1134230300301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7715852400 (or 7715852393 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 1134230300301 its reverse (1030030324311), we get a palindrome (2164260624612).
The spelling of 1134230300301 in words is "one trillion, one hundred thirty-four billion, two hundred thirty million, three hundred thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •