Base | Representation |
---|---|
bin | 110000111001101110… |
… | …0001000010111000111 |
3 | 101001001202001222110121 |
4 | 1201303130020113013 |
5 | 3210033042003343 |
6 | 120124344402411 |
7 | 10405252003324 |
oct | 1416334102707 |
9 | 331052058417 |
10 | 105015969223 |
11 | 4059a860010 |
12 | 18429776407 |
13 | 9b97a6cb79 |
14 | 51232bbb4b |
15 | 2ae9797aed |
hex | 18737085c7 |
105015969223 has 8 divisors (see below), whose sum is σ = 117357092496. Its totient is φ = 93140548800.
The previous prime is 105015969217. The next prime is 105015969257. The reversal of 105015969223 is 322969510501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-105015969223 is a prime.
It is a super-2 number, since 2×1050159692232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 105015969223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105015969283) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 116425236 + ... + 116426137.
It is an arithmetic number, because the mean of its divisors is an integer number (14669636562).
Almost surely, 2105015969223 is an apocalyptic number.
105015969223 is a deficient number, since it is larger than the sum of its proper divisors (12341123273).
105015969223 is a wasteful number, since it uses less digits than its factorization.
105015969223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 232851425.
The product of its (nonzero) digits is 145800, while the sum is 43.
The spelling of 105015969223 in words is "one hundred five billion, fifteen million, nine hundred sixty-nine thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •