Base | Representation |
---|---|
bin | 110001000001011111… |
… | …1110000000011001000 |
3 | 101001201221011221110020 |
4 | 1202002333300003020 |
5 | 3211101400340224 |
6 | 120210310420440 |
7 | 10414601303205 |
oct | 1420277600310 |
9 | 331657157406 |
10 | 105276965064 |
11 | 40714114057 |
12 | 184a1061720 |
13 | 9c09b6248b |
14 | 5149c1acac |
15 | 2b1264ec79 |
hex | 1882ff00c8 |
105276965064 has 64 divisors (see below), whose sum is σ = 264369268800. Its totient is φ = 34935664896.
The previous prime is 105276965051. The next prime is 105276965083. The reversal of 105276965064 is 460569672501.
It is a super-2 number, since 2×1052769650642 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105276964998 and 105276965016.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7116027 + ... + 7130805.
It is an arithmetic number, because the mean of its divisors is an integer number (4130769825).
Almost surely, 2105276965064 is an apocalyptic number.
It is an amenable number.
105276965064 is an abundant number, since it is smaller than the sum of its proper divisors (159092303736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105276965064 is a wasteful number, since it uses less digits than its factorization.
105276965064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16094 (or 16090 counting only the distinct ones).
The product of its (nonzero) digits is 2721600, while the sum is 51.
The spelling of 105276965064 in words is "one hundred five billion, two hundred seventy-six million, nine hundred sixty-five thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.153 sec. • engine limits •