Base | Representation |
---|---|
bin | 110001000010101001… |
… | …1111000011111101010 |
3 | 101001211122020210210222 |
4 | 1202011103320133222 |
5 | 3211141321000340 |
6 | 120214215010042 |
7 | 10415552334566 |
oct | 1420523703752 |
9 | 331748223728 |
10 | 105315796970 |
11 | 4073402703a |
12 | 184b2069922 |
13 | 9c14c0a437 |
14 | 51510486a6 |
15 | 2b15c708b5 |
hex | 18854f87ea |
105315796970 has 16 divisors (see below), whose sum is σ = 189809323488. Its totient is φ = 42072787920.
The previous prime is 105315796969. The next prime is 105315796973. The reversal of 105315796970 is 79697513501.
It is a super-2 number, since 2×1053157969702 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (105315796973) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6683096 + ... + 6698835.
It is an arithmetic number, because the mean of its divisors is an integer number (11863082718).
Almost surely, 2105315796970 is an apocalyptic number.
105315796970 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
105315796970 is a deficient number, since it is larger than the sum of its proper divisors (84493526518).
105315796970 is a wasteful number, since it uses less digits than its factorization.
105315796970 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13382725.
The product of its (nonzero) digits is 1786050, while the sum is 53.
The spelling of 105315796970 in words is "one hundred five billion, three hundred fifteen million, seven hundred ninety-six thousand, nine hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •