Base | Representation |
---|---|
bin | 11110101011010010010… |
… | …01011000000101100001 |
3 | 10201202122020101022110211 |
4 | 33111221021120011201 |
5 | 114232123422200103 |
6 | 2124114251254121 |
7 | 136102605061231 |
oct | 17255111300541 |
9 | 3652566338424 |
10 | 1054031053153 |
11 | 377015061931 |
12 | 150340a4a341 |
13 | 78519210400 |
14 | 39030291cc1 |
15 | 1c63ee6736d |
hex | f569258161 |
1054031053153 has 12 divisors (see below), whose sum is σ = 1201418145840. Its totient is φ = 921743752176.
The previous prime is 1054031053151. The next prime is 1054031053181. The reversal of 1054031053153 is 3513501304501.
It is not a de Polignac number, because 1054031053153 - 21 = 1054031053151 is a prime.
It is a super-2 number, since 2×10540310531532 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1054031053151) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 164124951 + ... + 164131372.
It is an arithmetic number, because the mean of its divisors is an integer number (100118178820).
Almost surely, 21054031053153 is an apocalyptic number.
1054031053153 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1054031053153 is a deficient number, since it is larger than the sum of its proper divisors (147387092687).
1054031053153 is a wasteful number, since it uses less digits than its factorization.
1054031053153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 328256368 (or 328256355 counting only the distinct ones).
The product of its (nonzero) digits is 13500, while the sum is 31.
Adding to 1054031053153 its reverse (3513501304501), we get a palindrome (4567532357654).
The spelling of 1054031053153 in words is "one trillion, fifty-four billion, thirty-one million, fifty-three thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •