Base | Representation |
---|---|
bin | 10000100000001010101… |
… | …110100101011110001101 |
3 | 11000102011222200121002011 |
4 | 100200022232211132031 |
5 | 122040014121203123 |
6 | 2224550452101221 |
7 | 144634564300432 |
oct | 20401256453615 |
9 | 4012158617064 |
10 | 1134051350413 |
11 | 3a7a48471603 |
12 | 163953604811 |
13 | 82c2c600a27 |
14 | 3cc619d1b89 |
15 | 1e7750e4e0d |
hex | 1080aba578d |
1134051350413 has 8 divisors (see below), whose sum is σ = 1141370376120. Its totient is φ = 1126733537280.
The previous prime is 1134051350407. The next prime is 1134051350447. The reversal of 1134051350413 is 3140531504311.
It can be written as a sum of positive squares in 4 ways, for example, as 24005783844 + 1110045566569 = 154938^2 + 1053587^2 .
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 1134051350413 - 25 = 1134051350381 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 (1134051350713) 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, 1612293 + ... + 2206261.
It is an arithmetic number, because the mean of its divisors is an integer number (142671297015).
Almost surely, 21134051350413 is an apocalyptic number.
It is an amenable number.
1134051350413 is a deficient number, since it is larger than the sum of its proper divisors (7319025707).
1134051350413 is a wasteful number, since it uses less digits than its factorization.
1134051350413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 606287.
The product of its (nonzero) digits is 10800, while the sum is 31.
Adding to 1134051350413 its reverse (3140531504311), we get a palindrome (4274582854724).
The spelling of 1134051350413 in words is "one trillion, one hundred thirty-four billion, fifty-one million, three hundred fifty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •