Base | Representation |
---|---|
bin | 11110101001011001110… |
… | …01000110111000011110 |
3 | 10201200000210012101111010 |
4 | 33110230321012320132 |
5 | 114223041124433142 |
6 | 2123430100240050 |
7 | 136035551431434 |
oct | 17245471067036 |
9 | 3650023171433 |
10 | 1053020155422 |
11 | 376646475464 |
12 | 1500ba3a0026 |
13 | 783b7958b81 |
14 | 38d75d08d54 |
15 | 1c5d1331e9c |
hex | f52ce46e1e |
1053020155422 has 8 divisors (see below), whose sum is σ = 2106040310856. Its totient is φ = 351006718472.
The previous prime is 1053020155403. The next prime is 1053020155519. The reversal of 1053020155422 is 2245510203501.
It is a sphenic number, since it is the product of 3 distinct primes.
1053020155422 is an admirable number.
It is a super-2 number, since 2×10530201554222 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1053020155422.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 87751679613 + ... + 87751679624.
It is an arithmetic number, because the mean of its divisors is an integer number (263255038857).
Almost surely, 21053020155422 is an apocalyptic number.
1053020155422 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1053020155422 is a wasteful number, since it uses less digits than its factorization.
1053020155422 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 175503359242.
The product of its (nonzero) digits is 12000, while the sum is 30.
Adding to 1053020155422 its reverse (2245510203501), we get a palindrome (3298530358923).
The spelling of 1053020155422 in words is "one trillion, fifty-three billion, twenty million, one hundred fifty-five thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •