Base | Representation |
---|---|
bin | 10100011010101000101… |
… | …010111000101010000111 |
3 | 11222010100201121111101122 |
4 | 110122220222320222013 |
5 | 140441310210343103 |
6 | 2552305130344155 |
7 | 203235244014362 |
oct | 24325052705207 |
9 | 4863321544348 |
10 | 1402989152903 |
11 | 4a100588a098 |
12 | 1a7aaa28b05b |
13 | a23bbc910c0 |
14 | 4bc955cb0d9 |
15 | 267657aeb38 |
hex | 146a8ab8a87 |
1402989152903 has 24 divisors (see below), whose sum is σ = 1594333698048. Its totient is φ = 1226816293248.
The previous prime is 1402989152899. The next prime is 1402989152923. The reversal of 1402989152903 is 3092519892041.
It is a happy number.
It is not a de Polignac number, because 1402989152903 - 22 = 1402989152899 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (53).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1402989152923) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 631175 + ... + 1790072.
It is an arithmetic number, because the mean of its divisors is an integer number (66430570752).
Almost surely, 21402989152903 is an apocalyptic number.
1402989152903 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1402989152903 is a deficient number, since it is larger than the sum of its proper divisors (191344545145).
1402989152903 is a wasteful number, since it uses less digits than its factorization.
1402989152903 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2421371 (or 2421342 counting only the distinct ones).
The product of its (nonzero) digits is 1399680, while the sum is 53.
The spelling of 1402989152903 in words is "one trillion, four hundred two billion, nine hundred eighty-nine million, one hundred fifty-two thousand, nine hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •