Base | Representation |
---|---|
bin | 100100101100001… |
… | …0010110000010101 |
3 | 10011210112121122011 |
4 | 1021120102300111 |
5 | 10010130330140 |
6 | 322054504221 |
7 | 42336135352 |
oct | 11130226025 |
9 | 3153477564 |
10 | 1231105045 |
11 | 581a21495 |
12 | 2a4365071 |
13 | 168095431 |
14 | b9709629 |
15 | 73131cea |
hex | 49612c15 |
1231105045 has 8 divisors (see below), whose sum is σ = 1479063096. Its totient is φ = 983726016.
The previous prime is 1231105037. The next prime is 1231105063. The reversal of 1231105045 is 5405011321.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 104898564 + 1126206481 = 10242^2 + 33559^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 1231105045 - 23 = 1231105037 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 140062 + ... + 148591.
It is an arithmetic number, because the mean of its divisors is an integer number (184882887).
Almost surely, 21231105045 is an apocalyptic number.
It is an amenable number.
1231105045 is a deficient number, since it is larger than the sum of its proper divisors (247958051).
1231105045 is an equidigital number, since it uses as much as digits as its factorization.
1231105045 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 289511.
The product of its (nonzero) digits is 600, while the sum is 22.
The square root of 1231105045 is about 35087.1065350222. The cubic root of 1231105045 is about 1071.7620383696.
Adding to 1231105045 its reverse (5405011321), we get a palindrome (6636116366).
It can be divided in two parts, 1231 and 105045, that added together give a square (106276 = 3262).
The spelling of 1231105045 in words is "one billion, two hundred thirty-one million, one hundred five thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •