Base | Representation |
---|---|
bin | 11101100001010011011… |
… | …10000100010100000011 |
3 | 10120222010011101201212112 |
4 | 32300221232010110003 |
5 | 113104302412132003 |
6 | 2053545115045535 |
7 | 133165413435431 |
oct | 16605156042403 |
9 | 3528104351775 |
10 | 1014312224003 |
11 | 3611928976a1 |
12 | 1446b71408ab |
13 | 74859495440 |
14 | 37143195d51 |
15 | 1b5b7ec03d8 |
hex | ec29b84503 |
1014312224003 has 16 divisors (see below), whose sum is σ = 1116202913280. Its totient is φ = 915853398816.
The previous prime is 1014312223979. The next prime is 1014312224021. The reversal of 1014312224003 is 3004222134101.
It is not a de Polignac number, because 1014312224003 - 28 = 1014312223747 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1014312224003.
It is not an unprimeable number, because it can be changed into a prime (1014312224203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 627368 + ... + 1556346.
It is an arithmetic number, because the mean of its divisors is an integer number (69762682080).
Almost surely, 21014312224003 is an apocalyptic number.
1014312224003 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1014312224003 is a deficient number, since it is larger than the sum of its proper divisors (101890689277).
1014312224003 is a wasteful number, since it uses less digits than its factorization.
1014312224003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 930826.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 1014312224003 its reverse (3004222134101), we get a palindrome (4018534358104).
The spelling of 1014312224003 in words is "one trillion, fourteen billion, three hundred twelve million, two hundred twenty-four thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •