Base | Representation |
---|---|
bin | 1101100110110100… |
… | …11100111010000010 |
3 | 200212002200121211100 |
4 | 12303122130322002 |
5 | 104430041214411 |
6 | 3204511555230 |
7 | 346011446313 |
oct | 66332347202 |
9 | 20762617740 |
10 | 7305023106 |
11 | 3109549a87 |
12 | 14ba52bb16 |
13 | 8c55721a4 |
14 | 4d427a60a |
15 | 2cb4bb456 |
hex | 1b369ce82 |
7305023106 has 12 divisors (see below), whose sum is σ = 15827550102. Its totient is φ = 2435007696.
The previous prime is 7305023101. The next prime is 7305023147. The reversal of 7305023106 is 6013205037.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 5749430625 + 1555592481 = 75825^2 + 39441^2 .
It is a super-3 number, since 3×73050231063 (a number of 31 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 7305023106.
It is not an unprimeable number, because it can be changed into a prime (7305023101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 202917291 + ... + 202917326.
Almost surely, 27305023106 is an apocalyptic number.
7305023106 is an abundant number, since it is smaller than the sum of its proper divisors (8522526996).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
7305023106 is a wasteful number, since it uses less digits than its factorization.
7305023106 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 405834625 (or 405834622 counting only the distinct ones).
The product of its (nonzero) digits is 3780, while the sum is 27.
The square root of 7305023106 is about 85469.4279026132. The cubic root of 7305023106 is about 1940.3222536556.
The spelling of 7305023106 in words is "seven billion, three hundred five million, twenty-three thousand, one hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •