Base | Representation |
---|---|
bin | 10111111011100010011010… |
… | …000100011010100111000100 |
3 | 111210122110111222221011201022 |
4 | 113323202122010122213010 |
5 | 102243324224122020040 |
6 | 1011501320254450312 |
7 | 31111543322631215 |
oct | 2773423204324704 |
9 | 453573458834638 |
10 | 105246463470020 |
11 | 3059785794a634 |
12 | b979577803998 |
13 | 46959116ac4b2 |
14 | 1bdbd5541d40c |
15 | c27a7e5d46b5 |
hex | 5fb89a11a9c4 |
105246463470020 has 48 divisors (see below), whose sum is σ = 221756664729600. Its totient is φ = 41957840776320.
The previous prime is 105246463470013. The next prime is 105246463470037. The reversal of 105246463470020 is 20074364642501.
It is a super-2 number, since 2×1052464634700202 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 47615741 + ... + 49777019.
It is an arithmetic number, because the mean of its divisors is an integer number (4619930515200).
Almost surely, 2105246463470020 is an apocalyptic number.
105246463470020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
105246463470020 is an abundant number, since it is smaller than the sum of its proper divisors (116510201259580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105246463470020 is a wasteful number, since it uses less digits than its factorization.
105246463470020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2169428 (or 2169426 counting only the distinct ones).
The product of its (nonzero) digits is 967680, while the sum is 44.
The spelling of 105246463470020 in words is "one hundred five trillion, two hundred forty-six billion, four hundred sixty-three million, four hundred seventy thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •