Base | Representation |
---|---|
bin | 10011001111101010… |
… | …11111111010111111 |
3 | 222200001111121021101 |
4 | 21213311133322333 |
5 | 132124443342343 |
6 | 4425122513531 |
7 | 514015440421 |
oct | 114765377277 |
9 | 28601447241 |
10 | 10332012223 |
11 | 4422173785 |
12 | 20042058a7 |
13 | c88716100 |
14 | 7002aa811 |
15 | 4070e1e4d |
hex | 267d5febf |
10332012223 has 12 divisors (see below), whose sum is σ = 11776760040. Its totient is φ = 9035279136.
The previous prime is 10332012203. The next prime is 10332012233. The reversal of 10332012223 is 32221023301.
It is not a de Polignac number, because 10332012223 - 225 = 10298457791 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10332012223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10332012203) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1605636 + ... + 1612057.
It is an arithmetic number, because the mean of its divisors is an integer number (981396670).
Almost surely, 210332012223 is an apocalyptic number.
10332012223 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
10332012223 is a deficient number, since it is larger than the sum of its proper divisors (1444747817).
10332012223 is a wasteful number, since it uses less digits than its factorization.
10332012223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3217738 (or 3217725 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 10332012223 its reverse (32221023301), we get a palindrome (42553035524).
The spelling of 10332012223 in words is "ten billion, three hundred thirty-two million, twelve thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •