Base | Representation |
---|---|
bin | 100000111110001101111010… |
… | …011100110111001100101000 |
3 | 201000110002222202101111121110 |
4 | 200332031322130313030220 |
5 | 123001343144002420240 |
6 | 1232230022501110320 |
7 | 42354563124316506 |
oct | 4076157234671450 |
9 | 630402882344543 |
10 | 145013035201320 |
11 | 42229756986460 |
12 | 143205b80b83a0 |
13 | 62bb89424cc30 |
14 | 27b494dd63676 |
15 | 11b71c62b4c80 |
hex | 83e37a737328 |
145013035201320 has 128 divisors (see below), whose sum is σ = 511094893357440. Its totient is φ = 32450469411840.
The previous prime is 145013035201319. The next prime is 145013035201373. The reversal of 145013035201320 is 23102530310541.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4225304379 + ... + 4225338698.
It is an arithmetic number, because the mean of its divisors is an integer number (3992928854355).
Almost surely, 2145013035201320 is an apocalyptic number.
145013035201320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
145013035201320 is an abundant number, since it is smaller than the sum of its proper divisors (366081858156120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145013035201320 is a wasteful number, since it uses less digits than its factorization.
145013035201320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8450643115 (or 8450643111 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 30.
Adding to 145013035201320 its reverse (23102530310541), we get a palindrome (168115565511861).
The spelling of 145013035201320 in words is "one hundred forty-five trillion, thirteen billion, thirty-five million, two hundred one thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •