Base | Representation |
---|---|
bin | 1000111101100110001… |
… | …0001000110110011110 |
3 | 112201102200020012210220 |
4 | 2033121202020312132 |
5 | 10010314201213012 |
6 | 154422345342210 |
7 | 14060414550600 |
oct | 2173142106636 |
9 | 481380205726 |
10 | 153973460382 |
11 | 5a333005805 |
12 | 25a11497966 |
13 | 1169a83ac51 |
14 | 7649397170 |
15 | 401286108c |
hex | 23d9888d9e |
153973460382 has 24 divisors (see below), whose sum is σ = 358223969736. Its totient is φ = 43992417168.
The previous prime is 153973460369. The next prime is 153973460387. The reversal of 153973460382 is 283064379351.
153973460382 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (153973460387) 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 in 11 ways as a sum of consecutive naturals, for example, 261859333 + ... + 261859920.
It is an arithmetic number, because the mean of its divisors is an integer number (14925998739).
It is a 1-persistent number, because it is pandigital, but 2⋅153973460382 = 307946920764 is not.
Almost surely, 2153973460382 is an apocalyptic number.
153973460382 is an abundant number, since it is smaller than the sum of its proper divisors (204250509354).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
153973460382 is a wasteful number, since it uses less digits than its factorization.
153973460382 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 523719272 (or 523719265 counting only the distinct ones).
The product of its (nonzero) digits is 3265920, while the sum is 51.
The spelling of 153973460382 in words is "one hundred fifty-three billion, nine hundred seventy-three million, four hundred sixty thousand, three hundred eighty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •