Base | Representation |
---|---|
bin | 100000111100000… |
… | …0111001000010011 |
3 | 2212000200102012202 |
4 | 1001320013020103 |
5 | 4230414301212 |
6 | 301400513415 |
7 | 36250166651 |
oct | 10170071023 |
9 | 2760612182 |
10 | 1105228307 |
11 | 517966427 |
12 | 26a17b86b |
13 | 147c91661 |
14 | a6adddd1 |
15 | 6706a0c2 |
hex | 41e07213 |
1105228307 has 4 divisors (see below), whose sum is σ = 1109430960. Its totient is φ = 1101025656.
The previous prime is 1105228303. The next prime is 1105228373. The reversal of 1105228307 is 7038225011.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 7038225011 = 3853 ⋅1826687.
It is a cyclic number.
It is not a de Polignac number, because 1105228307 - 22 = 1105228303 is a prime.
It is a super-2 number, since 2×11052283072 = 2443059221188172498, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1105228307.
It is not an unprimeable number, because it can be changed into a prime (1105228301) 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, 2100932 + ... + 2101457.
It is an arithmetic number, because the mean of its divisors is an integer number (277357740).
Almost surely, 21105228307 is an apocalyptic number.
1105228307 is a deficient number, since it is larger than the sum of its proper divisors (4202653).
1105228307 is an equidigital number, since it uses as much as digits as its factorization.
1105228307 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4202652.
The product of its (nonzero) digits is 3360, while the sum is 29.
The square root of 1105228307 is about 33244.9741615180. The cubic root of 1105228307 is about 1033.9130091170.
The spelling of 1105228307 in words is "one billion, one hundred five million, two hundred twenty-eight thousand, three hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •