Base | Representation |
---|---|
bin | 1011110101111111001000… |
… | …1111011100101010010011 |
3 | 1201002220100020101102002212 |
4 | 2331133302033130222103 |
5 | 3201323240130310003 |
6 | 43410135202502335 |
7 | 2512550011523063 |
oct | 275376217345223 |
9 | 51086306342085 |
10 | 13022110010003 |
11 | 4170711684536 |
12 | 15639323649ab |
13 | 735c97547183 |
14 | 3303b86413a3 |
15 | 178b05795dd8 |
hex | bd7f23dca93 |
13022110010003 has 8 divisors (see below), whose sum is σ = 13500243652800. Its totient is φ = 12545916058368.
The previous prime is 13022110009973. The next prime is 13022110010017. The reversal of 13022110010003 is 30001001122031.
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 13022110010003 - 232 = 13017815042707 is a prime.
It is a super-2 number, since 2×130221100100032 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13022110010003.
It is not an unprimeable number, because it can be changed into a prime (13022110010033) 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, 484909118 + ... + 484935971.
It is an arithmetic number, because the mean of its divisors is an integer number (1687530456600).
Almost surely, 213022110010003 is an apocalyptic number.
13022110010003 is a deficient number, since it is larger than the sum of its proper divisors (478133642797).
13022110010003 is an equidigital number, since it uses as much as digits as its factorization.
13022110010003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 969845581.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 13022110010003 its reverse (30001001122031), we get a palindrome (43023111132034).
The spelling of 13022110010003 in words is "thirteen trillion, twenty-two billion, one hundred ten million, ten thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •