Base | Representation |
---|---|
bin | 110001100001100110… |
… | …0110000001001010001 |
3 | 101011112000000211120222 |
4 | 1203003030300021101 |
5 | 3220303123141103 |
6 | 120505225442425 |
7 | 10453361030366 |
oct | 1430314601121 |
9 | 334460024528 |
10 | 106354115153 |
11 | 41117141940 |
12 | 18741940415 |
13 | a04c0727b0 |
14 | 520cccc46d |
15 | 2b76ec0638 |
hex | 18c3330251 |
106354115153 has 8 divisors (see below), whose sum is σ = 124947492096. Its totient is φ = 89248208400.
The previous prime is 106354115107. The next prime is 106354115159. The reversal of 106354115153 is 351511453601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 106354115153 - 28 = 106354114897 is a prime.
It is a super-2 number, since 2×1063541151532 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106354115159) 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, 371867393 + ... + 371867678.
It is an arithmetic number, because the mean of its divisors is an integer number (15618436512).
Almost surely, 2106354115153 is an apocalyptic number.
106354115153 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
106354115153 is a deficient number, since it is larger than the sum of its proper divisors (18593376943).
106354115153 is a wasteful number, since it uses less digits than its factorization.
106354115153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 743735095.
The product of its (nonzero) digits is 27000, while the sum is 35.
Adding to 106354115153 its reverse (351511453601), we get a palindrome (457865568754).
The spelling of 106354115153 in words is "one hundred six billion, three hundred fifty-four million, one hundred fifteen thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •