Base | Representation |
---|---|
bin | 10011000011100011… |
… | …00101010001111110 |
3 | 222101222011012221000 |
4 | 21201301211101332 |
5 | 131422430303202 |
6 | 4411051151130 |
7 | 511342206354 |
oct | 114161452176 |
9 | 28358135830 |
10 | 10230322302 |
11 | 437a828622 |
12 | 1b961454a6 |
13 | c70630365 |
14 | 6d09997d4 |
15 | 3ed20691c |
hex | 261c6547e |
10230322302 has 16 divisors (see below), whose sum is σ = 22734049680. Its totient is φ = 3410107416.
The previous prime is 10230322279. The next prime is 10230322387. The reversal of 10230322302 is 20322303201.
It is a happy number.
10230322302 is a `hidden beast` number, since 10 + 2 + 30 + 322 + 302 = 666.
10230322302 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 94725153 + ... + 94725260.
It is an arithmetic number, because the mean of its divisors is an integer number (1420878105).
Almost surely, 210230322302 is an apocalyptic number.
10230322302 is an abundant number, since it is smaller than the sum of its proper divisors (12503727378).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10230322302 is a wasteful number, since it uses less digits than its factorization.
10230322302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 189450424 (or 189450418 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 18.
Adding to 10230322302 its reverse (20322303201), we get a palindrome (30552625503).
The spelling of 10230322302 in words is "ten billion, two hundred thirty million, three hundred twenty-two thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •