Base | Representation |
---|---|
bin | 111100011101010… |
… | …010010101010110 |
3 | 2121200121022001120 |
4 | 330131102111112 |
5 | 4034130411410 |
6 | 244352104410 |
7 | 34064331453 |
oct | 7435222526 |
9 | 2550538046 |
10 | 1014310230 |
11 | 48060831a |
12 | 243835106 |
13 | 1321aa88b |
14 | 989d482a |
15 | 5e0ab570 |
hex | 3c752556 |
1014310230 has 128 divisors (see below), whose sum is σ = 2600294400. Its totient is φ = 252854784.
The previous prime is 1014310201. The next prime is 1014310247. The reversal of 1014310230 is 320134101.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3770536 + ... + 3770804.
It is an arithmetic number, because the mean of its divisors is an integer number (20314800).
Almost surely, 21014310230 is an apocalyptic number.
1014310230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1014310230, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1300147200).
1014310230 is an abundant number, since it is smaller than the sum of its proper divisors (1585984170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1014310230 is a wasteful number, since it uses less digits than its factorization.
1014310230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 438.
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 1014310230 is about 31848.2374708554. The cubic root of 1014310230 is about 1004.7475022217.
Adding to 1014310230 its reverse (320134101), we get a palindrome (1334444331).
The spelling of 1014310230 in words is "one billion, fourteen million, three hundred ten thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •