Base | Representation |
---|---|
bin | 100010110100011001010101… |
… | …101111010010011101110111 |
3 | 202002012111010212021221120002 |
4 | 202310121111233102131313 |
5 | 130032422321310300401 |
6 | 1301404514215301515 |
7 | 44153403201643331 |
oct | 4264312557223567 |
9 | 662174125257502 |
10 | 153134202431351 |
11 | 4487a93a087a29 |
12 | 1521252667a89b |
13 | 675a654ababbb |
14 | 29b5a40988451 |
15 | 12a858a8e6a6b |
hex | 8b4655bd2777 |
153134202431351 has 8 divisors (see below), whose sum is σ = 153247110404640. Its totient is φ = 153021316491648.
The previous prime is 153134202431323. The next prime is 153134202431363.
It is a happy number.
153134202431351 is nontrivially palindromic in base 10.
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 153134202431351 - 210 = 153134202430327 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 (153134202431311) 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, 8409755 + ... + 19416291.
It is an arithmetic number, because the mean of its divisors is an integer number (19155888800580).
Almost surely, 2153134202431351 is an apocalyptic number.
153134202431351 is a deficient number, since it is larger than the sum of its proper divisors (112907973289).
153134202431351 is a wasteful number, since it uses less digits than its factorization.
153134202431351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11016793.
The product of its (nonzero) digits is 129600, while the sum is 38.
It can be divided in two parts, 15313420 and 2431351, that added together give a palindrome (17744771).
The spelling of 153134202431351 in words is "one hundred fifty-three trillion, one hundred thirty-four billion, two hundred two million, four hundred thirty-one thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •