Base | Representation |
---|---|
bin | 110001001001001000… |
… | …0100001110010001010 |
3 | 101002101202222221121100 |
4 | 1202102100201302022 |
5 | 3212112423140242 |
6 | 120251534522230 |
7 | 10424130611001 |
oct | 1422220416212 |
9 | 332352887540 |
10 | 105533021322 |
11 | 408357039a3 |
12 | 18552966376 |
13 | 9c4ac15661 |
14 | 5171c31c38 |
15 | 2b29d7d54c |
hex | 1892421c8a |
105533021322 has 48 divisors (see below), whose sum is σ = 232090971840. Its totient is φ = 34649966400.
The previous prime is 105533021239. The next prime is 105533021327. The reversal of 105533021322 is 223120335501.
It is a happy number.
105533021322 is a `hidden beast` number, since 1 + 0 + 5 + 5 + 330 + 2 + 1 + 322 = 666.
It is a super-2 number, since 2×1055330213222 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105533021327) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1356454 + ... + 1432142.
It is an arithmetic number, because the mean of its divisors is an integer number (4835228580).
Almost surely, 2105533021322 is an apocalyptic number.
105533021322 is an abundant number, since it is smaller than the sum of its proper divisors (126557950518).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105533021322 is a wasteful number, since it uses less digits than its factorization.
105533021322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76859 (or 76856 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 27.
Adding to 105533021322 its reverse (223120335501), we get a palindrome (328653356823).
The spelling of 105533021322 in words is "one hundred five billion, five hundred thirty-three million, twenty-one thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •