Base | Representation |
---|---|
bin | 110001000010001111… |
… | …1110101010010011111 |
3 | 101001210200120120220201 |
4 | 1202010133311102133 |
5 | 3211124322333401 |
6 | 120213010324331 |
7 | 10415325345424 |
oct | 1420437652237 |
9 | 331720516821 |
10 | 105302152351 |
11 | 407273576a0 |
12 | 184a95896a7 |
13 | 9c121409b6 |
14 | 514d2d5d4b |
15 | 2b14977b01 |
hex | 18847f549f |
105302152351 has 8 divisors (see below), whose sum is σ = 115470285264. Its totient is φ = 95233221120.
The previous prime is 105302152289. The next prime is 105302152363. The reversal of 105302152351 is 153251203501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 105302152351 - 29 = 105302151839 is a prime.
It is a super-2 number, since 2×1053021523512 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105302152391) 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, 24798196 + ... + 24802441.
It is an arithmetic number, because the mean of its divisors is an integer number (14433785658).
Almost surely, 2105302152351 is an apocalyptic number.
105302152351 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
105302152351 is a deficient number, since it is larger than the sum of its proper divisors (10168132913).
105302152351 is a wasteful number, since it uses less digits than its factorization.
105302152351 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49600841.
The product of its (nonzero) digits is 4500, while the sum is 28.
Adding to 105302152351 its reverse (153251203501), we get a palindrome (258553355852).
The spelling of 105302152351 in words is "one hundred five billion, three hundred two million, one hundred fifty-two thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •