Base | Representation |
---|---|
bin | 1000011101011110011… |
… | …0111110101000100110 |
3 | 111220011210000001022210 |
4 | 2013113212332220212 |
5 | 4340134404141410 |
6 | 150435021304250 |
7 | 13333640104530 |
oct | 2072746765046 |
9 | 456153001283 |
10 | 145351240230 |
11 | 56708a93129 |
12 | 24205a05086 |
13 | 1092541c431 |
14 | 706c200850 |
15 | 3baa909220 |
hex | 21d79bea26 |
145351240230 has 32 divisors (see below), whose sum is σ = 398677688064. Its totient is φ = 33223140576.
The previous prime is 145351240211. The next prime is 145351240231. The reversal of 145351240230 is 32042153541.
It is a super-2 number, since 2×1453512402302 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145351240231) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 346074172 + ... + 346074591.
It is an arithmetic number, because the mean of its divisors is an integer number (12458677752).
Almost surely, 2145351240230 is an apocalyptic number.
145351240230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
145351240230 is an abundant number, since it is smaller than the sum of its proper divisors (253326447834).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145351240230 is a wasteful number, since it uses less digits than its factorization.
145351240230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 692148780.
The product of its (nonzero) digits is 14400, while the sum is 30.
Adding to 145351240230 its reverse (32042153541), we get a palindrome (177393393771).
The spelling of 145351240230 in words is "one hundred forty-five billion, three hundred fifty-one million, two hundred forty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •