Base | Representation |
---|---|
bin | 10111111110011100101110… |
… | …000101010010101001001000 |
3 | 111211100120212221121012002220 |
4 | 113332130232011102221020 |
5 | 102310113430344114422 |
6 | 1012133243234054040 |
7 | 31132154642523660 |
oct | 2776345605225110 |
9 | 454316787535086 |
10 | 105446515223112 |
11 | 30664685949688 |
12 | b9b02a871a320 |
13 | 46ab74364b9ab |
14 | 1c078d23331a0 |
15 | c2cd8c37ce5c |
hex | 5fe72e152a48 |
105446515223112 has 32 divisors (see below), whose sum is σ = 301275757780800. Its totient is φ = 30127575777984.
The previous prime is 105446515223087. The next prime is 105446515223227. The reversal of 105446515223112 is 211322515644501.
It is a super-2 number, since 2×1054465152231122 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
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, 313828914187 + ... + 313828914522.
It is an arithmetic number, because the mean of its divisors is an integer number (9414867430650).
Almost surely, 2105446515223112 is an apocalyptic number.
105446515223112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
105446515223112 is an abundant number, since it is smaller than the sum of its proper divisors (195829242557688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105446515223112 is a wasteful number, since it uses less digits than its factorization.
105446515223112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 627657828725 (or 627657828721 counting only the distinct ones).
The product of its (nonzero) digits is 288000, while the sum is 42.
The spelling of 105446515223112 in words is "one hundred five trillion, four hundred forty-six billion, five hundred fifteen million, two hundred twenty-three thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •