Base | Representation |
---|---|
bin | 1000111011111000101… |
… | …0001111010010111010 |
3 | 112200020200001220101122 |
4 | 2032332022033102322 |
5 | 10003344114213430 |
6 | 154305022145242 |
7 | 14043140154614 |
oct | 2167612172272 |
9 | 480220056348 |
10 | 153514210490 |
11 | 5a117851543 |
12 | 25903722222 |
13 | 11626652c54 |
14 | 76043abdb4 |
15 | 3ed7396ee5 |
hex | 23be28f4ba |
153514210490 has 16 divisors (see below), whose sum is σ = 276331198248. Its totient is φ = 61404435456.
The previous prime is 153514210477. The next prime is 153514210501. The reversal of 153514210490 is 94012415351.
It can be written as a sum of positive squares in 4 ways, for example, as 128917620601 + 24596589889 = 359051^2 + 156833^2 .
It is a super-2 number, since 2×1535142104902 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 153514210490.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 486014 + ... + 737046.
Almost surely, 2153514210490 is an apocalyptic number.
153514210490 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
153514210490 is a deficient number, since it is larger than the sum of its proper divisors (122816987758).
153514210490 is a wasteful number, since it uses less digits than its factorization.
153514210490 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 312193.
The product of its (nonzero) digits is 21600, while the sum is 35.
The spelling of 153514210490 in words is "one hundred fifty-three billion, five hundred fourteen million, two hundred ten thousand, four hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •