Base | Representation |
---|---|
bin | 10000001101100111100… |
… | …110000001011100110001 |
3 | 10221111202221201022122111 |
4 | 100031213212001130301 |
5 | 121223221421102241 |
6 | 2211454254005321 |
7 | 143331202265032 |
oct | 20154746013461 |
9 | 3844687638574 |
10 | 1114134550321 |
11 | 39a5579a9941 |
12 | 15bb154a6841 |
13 | 810a7236b10 |
14 | 3bcd27a6a89 |
15 | 1deab810c81 |
hex | 10367981731 |
1114134550321 has 4 divisors (see below), whose sum is σ = 1199837208052. Its totient is φ = 1028431892592.
The previous prime is 1114134550259. The next prime is 1114134550339. The reversal of 1114134550321 is 1230554314111.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 104985720225 + 1009148830096 = 324015^2 + 1004564^2 .
It is not a de Polignac number, because 1114134550321 - 215 = 1114134517553 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1114134554321) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 42851328846 + ... + 42851328871.
It is an arithmetic number, because the mean of its divisors is an integer number (299959302013).
Almost surely, 21114134550321 is an apocalyptic number.
It is an amenable number.
1114134550321 is a deficient number, since it is larger than the sum of its proper divisors (85702657731).
1114134550321 is an equidigital number, since it uses as much as digits as its factorization.
1114134550321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 85702657730.
The product of its (nonzero) digits is 7200, while the sum is 31.
Adding to 1114134550321 its reverse (1230554314111), we get a palindrome (2344688864432).
The spelling of 1114134550321 in words is "one trillion, one hundred fourteen billion, one hundred thirty-four million, five hundred fifty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •