Base | Representation |
---|---|
bin | 1000111010001111100… |
… | …1101011000011001010 |
3 | 112122002222002121212202 |
4 | 2032203321223003022 |
5 | 10001443324110411 |
6 | 154153203440202 |
7 | 14026210433303 |
oct | 2164371530312 |
9 | 478088077782 |
10 | 153073660106 |
11 | 59a110aa514 |
12 | 25800086062 |
13 | 115862b4453 |
14 | 75a1a8d7aa |
15 | 3ead87383b |
hex | 23a3e6b0ca |
153073660106 has 4 divisors (see below), whose sum is σ = 229610490162. Its totient is φ = 76536830052.
The previous prime is 153073660079. The next prime is 153073660109. The reversal of 153073660106 is 601066370351.
153073660106 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 152010313225 + 1063346881 = 389885^2 + 32609^2 .
It is a super-3 number, since 3×1530736601063 (a number of 35 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 153073660106.
It is not an unprimeable number, because it can be changed into a prime (153073660109) 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 as a sum of consecutive naturals, namely, 38268415025 + ... + 38268415028.
Almost surely, 2153073660106 is an apocalyptic number.
153073660106 is a deficient number, since it is larger than the sum of its proper divisors (76536830056).
153073660106 is an equidigital number, since it uses as much as digits as its factorization.
153073660106 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76536830055.
The product of its (nonzero) digits is 68040, while the sum is 38.
The spelling of 153073660106 in words is "one hundred fifty-three billion, seventy-three million, six hundred sixty thousand, one hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •