Base | Representation |
---|---|
bin | 11111101111001001010… |
… | …11000010010100001000 |
3 | 10212020200020220210010022 |
4 | 33313210223002110020 |
5 | 120331232040302213 |
6 | 2152541335040012 |
7 | 141532460242154 |
oct | 17674453022410 |
9 | 3766606823108 |
10 | 1090463212808 |
11 | 390510067692 |
12 | 157409b10008 |
13 | 7baa4062828 |
14 | 3aac8a82064 |
15 | 1d5735e1308 |
hex | fde4ac2508 |
1090463212808 has 60 divisors (see below), whose sum is σ = 2122475281515. Its totient is φ = 525231358176.
The previous prime is 1090463212799. The next prime is 1090463212819. The reversal of 1090463212808 is 8082123640901.
It is a happy number.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 3 ways, for example, as 598330096324 + 492133116484 = 773518^2 + 701522^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=738398.
It is a super-2 number, since 2×10904632128082 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 2483970653 + ... + 2483971091.
Almost surely, 21090463212808 is an apocalyptic number.
It is an amenable number.
1090463212808 is a deficient number, since it is larger than the sum of its proper divisors (1032012068707).
1090463212808 is an frugal number, since it uses more digits than its factorization.
1090463212808 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1000 (or 470 counting only the distinct ones).
The product of its (nonzero) digits is 165888, while the sum is 44.
The spelling of 1090463212808 in words is "one trillion, ninety billion, four hundred sixty-three million, two hundred twelve thousand, eight hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •