Base | Representation |
---|---|
bin | 10011000011100011… |
… | …00000011000000110 |
3 | 222101222010012101000 |
4 | 21201301200120012 |
5 | 131422424132324 |
6 | 4411050514130 |
7 | 511342063656 |
oct | 114161403006 |
9 | 28358105330 |
10 | 10230302214 |
11 | 437a814520 |
12 | 1b96135946 |
13 | c70624182 |
14 | 6d0992366 |
15 | 3ed2009c9 |
hex | 261c60606 |
10230302214 has 64 divisors (see below), whose sum is σ = 24828768000. Its totient is φ = 3096587520.
The previous prime is 10230302213. The next prime is 10230302239. The reversal of 10230302214 is 41220303201.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10230302213) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 542557 + ... + 561095.
It is an arithmetic number, because the mean of its divisors is an integer number (387949500).
Almost surely, 210230302214 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10230302214, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12414384000).
10230302214 is an abundant number, since it is smaller than the sum of its proper divisors (14598465786).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10230302214 is a wasteful number, since it uses less digits than its factorization.
10230302214 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19490 (or 19484 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 10230302214 its reverse (41220303201), we get a palindrome (51450605415).
The spelling of 10230302214 in words is "ten billion, two hundred thirty million, three hundred two thousand, two hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •