Base | Representation |
---|---|
bin | 10100011010110101010… |
… | …000000101101010111000 |
3 | 11222010220102210102122102 |
4 | 110122311100011222320 |
5 | 140442223224411440 |
6 | 2552342110442532 |
7 | 203243416114601 |
oct | 24326520055270 |
9 | 4863812712572 |
10 | 1403200232120 |
11 | 4a1103a4a025 |
12 | 1a7b48b03448 |
13 | a242392724b |
14 | 4bcb5654da8 |
15 | 267790a6b15 |
hex | 146b5405ab8 |
1403200232120 has 16 divisors (see below), whose sum is σ = 3157200522360. Its totient is φ = 561280092832.
The previous prime is 1403200232107. The next prime is 1403200232123. The reversal of 1403200232120 is 212320023041.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 1403200232092 and 1403200232101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1403200232123) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17540002862 + ... + 17540002941.
Almost surely, 21403200232120 is an apocalyptic number.
1403200232120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1403200232120 is an abundant number, since it is smaller than the sum of its proper divisors (1754000290240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1403200232120 is a wasteful number, since it uses less digits than its factorization.
1403200232120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35080005814 (or 35080005810 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 1403200232120 its reverse (212320023041), we get a palindrome (1615520255161).
The spelling of 1403200232120 in words is "one trillion, four hundred three billion, two hundred million, two hundred thirty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •