Base | Representation |
---|---|
bin | 111011110011101… |
… | …010101111000011 |
3 | 2120221002000012211 |
4 | 323303222233003 |
5 | 4023332301011 |
6 | 243322202551 |
7 | 33602521546 |
oct | 7363525703 |
9 | 2527060184 |
10 | 1003400131 |
11 | 475436408 |
12 | 240053457 |
13 | 12cb5a9b6 |
14 | 9739485d |
15 | 5d153b21 |
hex | 3bceabc3 |
1003400131 has 4 divisors (see below), whose sum is σ = 1003625352. Its totient is φ = 1003174912.
The previous prime is 1003400119. The next prime is 1003400149. The reversal of 1003400131 is 1310043001.
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 1003400131 - 221 = 1001302979 is a prime.
It is a super-3 number, since 3×10034001313 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1003400191) 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 3 ways as a sum of consecutive naturals, for example, 105790 + ... + 114883.
It is an arithmetic number, because the mean of its divisors is an integer number (250906338).
Almost surely, 21003400131 is an apocalyptic number.
1003400131 is a deficient number, since it is larger than the sum of its proper divisors (225221).
1003400131 is an equidigital number, since it uses as much as digits as its factorization.
1003400131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 225220.
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 1003400131 is about 31676.4917722907. The cubic root of 1003400131 is about 1001.1320948775.
Adding to 1003400131 its reverse (1310043001), we get a palindrome (2313443132).
The spelling of 1003400131 in words is "one billion, three million, four hundred thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •