Base | Representation |
---|---|
bin | 10011000010101011… |
… | …10001000000100110 |
3 | 222101110102202012020 |
4 | 21201111301000212 |
5 | 131414043432220 |
6 | 4410231004010 |
7 | 511223216043 |
oct | 114125610046 |
9 | 28343382166 |
10 | 10223030310 |
11 | 43766a7a89 |
12 | 1b93809606 |
13 | c6bc7927c |
14 | 6cda1c1ca |
15 | 3ec766040 |
hex | 261571026 |
10223030310 has 32 divisors (see below), whose sum is σ = 24538678272. Its totient is φ = 2725763040.
The previous prime is 10223030299. The next prime is 10223030327. The reversal of 10223030310 is 1303032201.
It is a super-2 number, since 2×102230303102 (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 10223030310.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 246795 + ... + 285225.
It is an arithmetic number, because the mean of its divisors is an integer number (766833696).
Almost surely, 210223030310 is an apocalyptic number.
10223030310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10223030310 is an abundant number, since it is smaller than the sum of its proper divisors (14315647962).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10223030310 is a wasteful number, since it uses less digits than its factorization.
10223030310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47308.
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 10223030310 its reverse (1303032201), we get a palindrome (11526062511).
The spelling of 10223030310 in words is "ten billion, two hundred twenty-three million, thirty thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •