Base | Representation |
---|---|
bin | 110001100101011000… |
… | …0101011000111010010 |
3 | 101011211211201211210200 |
4 | 1203022300223013102 |
5 | 3221033112102432 |
6 | 120530000440030 |
7 | 10456461221211 |
oct | 1431260530722 |
9 | 334754654720 |
10 | 106480972242 |
11 | 41181807507 |
12 | 18778319016 |
13 | a06c42a868 |
14 | 5221ab1078 |
15 | 2b831cca7c |
hex | 18cac2b1d2 |
106480972242 has 18 divisors (see below), whose sum is σ = 230711772837. Its totient is φ = 35493195936.
The previous prime is 106480972229. The next prime is 106480972253. The reversal of 106480972242 is 242279084601.
106480972242 is a `hidden beast` number, since 106 + 480 + 9 + 7 + 22 + 42 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 104418813321 + 2062158921 = 323139^2 + 45411^2 .
It is a tau number, because it is divible by the number of its divisors (18).
It is an ABA number since it can be written as A⋅BA, here for A=2, B=230739.
It is a super-2 number, since 2×1064809722422 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 1345978 + ... + 1422890.
Almost surely, 2106480972242 is an apocalyptic number.
106480972242 is an abundant number, since it is smaller than the sum of its proper divisors (124230800595).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106480972242 is an frugal number, since it uses more digits than its factorization.
106480972242 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153834 (or 76918 counting only the distinct ones).
The product of its (nonzero) digits is 387072, while the sum is 45.
The spelling of 106480972242 in words is "one hundred six billion, four hundred eighty million, nine hundred seventy-two thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •