Base | Representation |
---|---|
bin | 10011001100000110… |
… | …01000100110110110 |
3 | 222120222002110120020 |
4 | 21212003020212312 |
5 | 132044310013220 |
6 | 4422132150010 |
7 | 513202554423 |
oct | 114603104666 |
9 | 28528073506 |
10 | 10302032310 |
11 | 4407257399 |
12 | 1bb6168306 |
13 | c8244a30b |
14 | 6da304d4a |
15 | 40466e040 |
hex | 2660c89b6 |
10302032310 has 16 divisors (see below), whose sum is σ = 24724877616. Its totient is φ = 2747208608.
The previous prime is 10302032267. The next prime is 10302032311. The reversal of 10302032310 is 1323020301.
It is a super-2 number, since 2×103020323102 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 10302032310.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10302032311) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 171700509 + ... + 171700568.
It is an arithmetic number, because the mean of its divisors is an integer number (1545304851).
Almost surely, 210302032310 is an apocalyptic number.
10302032310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10302032310 is an abundant number, since it is smaller than the sum of its proper divisors (14422845306).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10302032310 is a wasteful number, since it uses less digits than its factorization.
10302032310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 343401087.
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 10302032310 its reverse (1323020301), we get a palindrome (11625052611).
The spelling of 10302032310 in words is "ten billion, three hundred two million, thirty-two thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •