Base | Representation |
---|---|
bin | 100001000101111000111000… |
… | …000110111011000111000010 |
3 | 201002022111200222212001112222 |
4 | 201011320320012323013002 |
5 | 123034012314000200310 |
6 | 1233312125111251042 |
7 | 42440634623640200 |
oct | 4105707006730702 |
9 | 632274628761488 |
10 | 145540203131330 |
11 | 42412287495877 |
12 | 143a67bb679a82 |
13 | 63294c7ab7627 |
14 | 27d227d420070 |
15 | 11c5c7c0a0055 |
hex | 845e381bb1c2 |
145540203131330 has 96 divisors (see below), whose sum is σ = 322678506061296. Its totient is φ = 46962914697216.
The previous prime is 145540203131329. The next prime is 145540203131363. The reversal of 145540203131330 is 33131302045541.
It can be written as a sum of positive squares in 8 ways, for example, as 13909028529361 + 131631174601969 = 3729481^2 + 11473063^2 .
It is a Harshad number since it is a multiple of its sum of digits (35).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 321753482 + ... + 322205498.
Almost surely, 2145540203131330 is an apocalyptic number.
145540203131330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
145540203131330 is an abundant number, since it is smaller than the sum of its proper divisors (177138302929966).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145540203131330 is a wasteful number, since it uses less digits than its factorization.
145540203131330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 490708 (or 490701 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 35.
Adding to 145540203131330 its reverse (33131302045541), we get a palindrome (178671505176871).
The spelling of 145540203131330 in words is "one hundred forty-five trillion, five hundred forty billion, two hundred three million, one hundred thirty-one thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •