Base | Representation |
---|---|
bin | 1000111010001110101… |
… | …1111110101001001111 |
3 | 112122002201100020122212 |
4 | 2032203223332221033 |
5 | 10001441414222401 |
6 | 154152554501035 |
7 | 14026135062452 |
oct | 2164353765117 |
9 | 478081306585 |
10 | 153070070351 |
11 | 59a0a078480 |
12 | 257baa3477b |
13 | 11585628533 |
14 | 75a13d7499 |
15 | 3ead3b4dbb |
hex | 23a3afea4f |
153070070351 has 16 divisors (see below), whose sum is σ = 168682500000. Its totient is φ = 137741184000.
The previous prime is 153070070347. The next prime is 153070070383.
153070070351 is nontrivially palindromic in base 10.
It is a cyclic number.
It is not a de Polignac number, because 153070070351 - 22 = 153070070347 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (153070000351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4882775 + ... + 4914023.
It is an arithmetic number, because the mean of its divisors is an integer number (10542656250).
Almost surely, 2153070070351 is an apocalyptic number.
153070070351 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
153070070351 is a deficient number, since it is larger than the sum of its proper divisors (15612429649).
153070070351 is a wasteful number, since it uses less digits than its factorization.
153070070351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35770.
The product of its (nonzero) digits is 11025, while the sum is 32.
The spelling of 153070070351 in words is "one hundred fifty-three billion, seventy million, seventy thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •