Base | Representation |
---|---|
bin | 10011010010011010… |
… | …10001010110101111 |
3 | 222201122210120200212 |
4 | 21221031101112233 |
5 | 132201341134411 |
6 | 4431304013035 |
7 | 514415141162 |
oct | 115115212657 |
9 | 28648716625 |
10 | 10355021231 |
11 | 4434159795 |
12 | 200ba6117b |
13 | c90410cc9 |
14 | 703379ad9 |
15 | 40913968b |
hex | 2693515af |
10355021231 has 8 divisors (see below), whose sum is σ = 10381952880. Its totient is φ = 10328110848.
The previous prime is 10355021203. The next prime is 10355021239. The reversal of 10355021231 is 13212055301.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10355021231 - 26 = 10355021167 is a prime.
It is a super-3 number, since 3×103550212313 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10355021197 and 10355021206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10355021239) 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, 1476425 + ... + 1483421.
It is an arithmetic number, because the mean of its divisors is an integer number (1297744110).
Almost surely, 210355021231 is an apocalyptic number.
10355021231 is a deficient number, since it is larger than the sum of its proper divisors (26931649).
10355021231 is an equidigital number, since it uses as much as digits as its factorization.
10355021231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10633.
The product of its (nonzero) digits is 900, while the sum is 23.
Adding to 10355021231 its reverse (13212055301), we get a palindrome (23567076532).
The spelling of 10355021231 in words is "ten billion, three hundred fifty-five million, twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •