Base | Representation |
---|---|
bin | 10000001010010100000… |
… | …001000001010101011101 |
3 | 10221011121120100021010122 |
4 | 100022110001001111131 |
5 | 121143434210423244 |
6 | 2210110131444325 |
7 | 143144220351500 |
oct | 20122401012535 |
9 | 3834546307118 |
10 | 1110584857949 |
11 | 398aa6221486 |
12 | 15b2a47566a5 |
13 | 8095c9bc128 |
14 | 3ba77191137 |
15 | 1dd4ed8a1ee |
hex | 1029404155d |
1110584857949 has 6 divisors (see below), whose sum is σ = 1291904834814. Its totient is φ = 951929878200.
The previous prime is 1110584857937. The next prime is 1110584858021. The reversal of 1110584857949 is 9497584850111.
It can be written as a sum of positive squares in only one way, i.e., 1089324301849 + 21260556100 = 1043707^2 + 145810^2 .
It is not a de Polignac number, because 1110584857949 - 212 = 1110584853853 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1110584857891 and 1110584857900.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1110584857549) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 11332498502 + ... + 11332498599.
It is an arithmetic number, because the mean of its divisors is an integer number (215317472469).
Almost surely, 21110584857949 is an apocalyptic number.
It is an amenable number.
1110584857949 is a deficient number, since it is larger than the sum of its proper divisors (181319976865).
1110584857949 is an equidigital number, since it uses as much as digits as its factorization.
1110584857949 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22664997115 (or 22664997108 counting only the distinct ones).
The product of its (nonzero) digits is 14515200, while the sum is 62.
The spelling of 1110584857949 in words is "one trillion, one hundred ten billion, five hundred eighty-four million, eight hundred fifty-seven thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •