Base | Representation |
---|---|
bin | 1001010011011110001000… |
… | …1001101110011010100011 |
3 | 1100012222201001022002111102 |
4 | 2110313202021232122203 |
5 | 2320102232000111003 |
6 | 33431352005305015 |
7 | 2104046460400253 |
oct | 224674211563243 |
9 | 40188631262442 |
10 | 10230111332003 |
11 | 329462516a672 |
12 | 11927b770516b |
13 | 5929069201c4 |
14 | 2751d6359963 |
15 | 12b196b83588 |
hex | 94de226e6a3 |
10230111332003 has 4 divisors (see below), whose sum is σ = 10230583941600. Its totient is φ = 10229638722408.
The previous prime is 10230111331939. The next prime is 10230111332011. The reversal of 10230111332003 is 30023311103201.
10230111332003 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10230111332003 - 26 = 10230111331939 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10230111322003) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 236272328 + ... + 236315621.
It is an arithmetic number, because the mean of its divisors is an integer number (2557645985400).
Almost surely, 210230111332003 is an apocalyptic number.
10230111332003 is a deficient number, since it is larger than the sum of its proper divisors (472609597).
10230111332003 is an equidigital number, since it uses as much as digits as its factorization.
10230111332003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 472609596.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 10230111332003 its reverse (30023311103201), we get a palindrome (40253422435204).
The spelling of 10230111332003 in words is "ten trillion, two hundred thirty billion, one hundred eleven million, three hundred thirty-two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •