Base | Representation |
---|---|
bin | 10100011100101100101… |
… | …000111101111000100100 |
3 | 11222100002000210220101020 |
4 | 110130230220331320210 |
5 | 141010324012230112 |
6 | 2553312542131140 |
7 | 203344150325235 |
oct | 24345450757044 |
9 | 4870060726336 |
10 | 1405203242532 |
11 | 4a1a41662431 |
12 | 1a8407880ab0 |
13 | a26828b68cb |
14 | 4c02569508c |
15 | 26844d6148c |
hex | 1472ca3de24 |
1405203242532 has 24 divisors (see below), whose sum is σ = 3292879707936. Its totient is φ = 466390774848.
The previous prime is 1405203242507. The next prime is 1405203242533. The reversal of 1405203242532 is 2352423025041.
It is a junction number, because it is equal to n+sod(n) for n = 1405203242493 and 1405203242502.
It is not an unprimeable number, because it can be changed into a prime (1405203242533) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 251285338 + ... + 251290929.
It is an arithmetic number, because the mean of its divisors is an integer number (137203321164).
Almost surely, 21405203242532 is an apocalyptic number.
1405203242532 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1405203242532 is an abundant number, since it is smaller than the sum of its proper divisors (1887676465404).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1405203242532 is a wasteful number, since it uses less digits than its factorization.
1405203242532 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 502576507 (or 502576505 counting only the distinct ones).
The product of its (nonzero) digits is 57600, while the sum is 33.
Adding to 1405203242532 its reverse (2352423025041), we get a palindrome (3757626267573).
The spelling of 1405203242532 in words is "one trillion, four hundred five billion, two hundred three million, two hundred forty-two thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •