Base | Representation |
---|---|
bin | 100010110111100010110010… |
… | …010100110011000111101110 |
3 | 202002222011110022002212212000 |
4 | 202313202302110303013232 |
5 | 130044443313024224402 |
6 | 1302052125443353130 |
7 | 44205131310035523 |
oct | 4267426224630756 |
9 | 662864408085760 |
10 | 153350504133102 |
11 | 4495364681aa11 |
12 | 152484316827a6 |
13 | 6774b76538833 |
14 | 29c22bdad514a |
15 | 12adeea0a9c1c |
hex | 8b78b25331ee |
153350504133102 has 32 divisors (see below), whose sum is σ = 345092555020800. Its totient is φ = 50469786168984.
The previous prime is 153350504133037. The next prime is 153350504133109. The reversal of 153350504133102 is 201331405053351.
153350504133102 is a `hidden beast` number, since 1 + 5 + 3 + 3 + 5 + 0 + 504 + 133 + 10 + 2 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (153350504133109) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17973566308 + ... + 17973574839.
It is an arithmetic number, because the mean of its divisors is an integer number (10784142344400).
Almost surely, 2153350504133102 is an apocalyptic number.
153350504133102 is an abundant number, since it is smaller than the sum of its proper divisors (191742050887698).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
153350504133102 is a wasteful number, since it uses less digits than its factorization.
153350504133102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35947141237 (or 35947141231 counting only the distinct ones).
The product of its (nonzero) digits is 81000, while the sum is 36.
Adding to 153350504133102 its reverse (201331405053351), we get a palindrome (354681909186453).
The spelling of 153350504133102 in words is "one hundred fifty-three trillion, three hundred fifty billion, five hundred four million, one hundred thirty-three thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •