Base | Representation |
---|---|
bin | 1000111100011110110… |
… | …0001111111101011100 |
3 | 112200122210222012110001 |
4 | 2033013230033331130 |
5 | 10004211033333202 |
6 | 154332533424044 |
7 | 14050121322304 |
oct | 2170754177534 |
9 | 480583865401 |
10 | 153674121052 |
11 | 5a19a042731 |
12 | 2594919b024 |
13 | 11650811a9a |
14 | 761b716604 |
15 | 3ee6432d87 |
hex | 23c7b0ff5c |
153674121052 has 24 divisors (see below), whose sum is σ = 281075760000. Its totient is φ = 73377557616.
The previous prime is 153674121049. The next prime is 153674121053. The reversal of 153674121052 is 250121476351.
It is a super-2 number, since 2×1536741210522 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (153674121053) 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 7 ways as a sum of consecutive naturals, for example, 1292302 + ... + 1406197.
It is an arithmetic number, because the mean of its divisors is an integer number (11711490000).
Almost surely, 2153674121052 is an apocalyptic number.
It is an amenable number.
153674121052 is a deficient number, since it is larger than the sum of its proper divisors (127401638948).
153674121052 is a wasteful number, since it uses less digits than its factorization.
153674121052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2699145 (or 2699143 counting only the distinct ones).
The product of its (nonzero) digits is 50400, while the sum is 37.
The spelling of 153674121052 in words is "one hundred fifty-three billion, six hundred seventy-four million, one hundred twenty-one thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •