Base | Representation |
---|---|
bin | 10100011010101011000… |
… | …111000101111111110100 |
3 | 11222010110120122221000000 |
4 | 110122223013011333310 |
5 | 140441401201231004 |
6 | 2552313152151300 |
7 | 203236252044456 |
oct | 24325307057764 |
9 | 4863416587000 |
10 | 1403030102004 |
11 | 4a1026a08823 |
12 | 1a7abbb38530 |
13 | a23c75ca93b |
14 | 4bc9ac0a2d6 |
15 | 2676919cc39 |
hex | 146ab1c5ff4 |
1403030102004 has 84 divisors (see below), whose sum is σ = 3687339343744. Its totient is φ = 466905639312.
The previous prime is 1403030101987. The next prime is 1403030102027. The reversal of 1403030102004 is 4002010303041.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 1373679 + ... + 2166345.
Almost surely, 21403030102004 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1403030102004, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1843669671872).
1403030102004 is an abundant number, since it is smaller than the sum of its proper divisors (2284309241740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1403030102004 is an equidigital number, since it uses as much as digits as its factorization.
1403030102004 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 793296 (or 793279 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 1403030102004 its reverse (4002010303041), we get a palindrome (5405040405045).
The spelling of 1403030102004 in words is "one trillion, four hundred three billion, thirty million, one hundred two thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •