Base | Representation |
---|---|
bin | 11110101001101001101… |
… | …11110011111010100001 |
3 | 10201200101010010002102112 |
4 | 33110310313303322201 |
5 | 114223324413031223 |
6 | 2123451241525105 |
7 | 136042065403124 |
oct | 17246467637241 |
9 | 3650333102375 |
10 | 1053154033313 |
11 | 376704aa5948 |
12 | 1501371a3795 |
13 | 78409601765 |
14 | 38d899d83bb |
15 | 1c5dce79778 |
hex | f534df3ea1 |
1053154033313 has 16 divisors (see below), whose sum is σ = 1077442248960. Its totient is φ = 1029171635856.
The previous prime is 1053154033303. The next prime is 1053154033319. The reversal of 1053154033313 is 3133304513501.
It is a cyclic number.
It is not a de Polignac number, because 1053154033313 - 24 = 1053154033297 is a prime.
It is a super-2 number, since 2×10531540333132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1053154033313.
It is not an unprimeable number, because it can be changed into a prime (1053154033319) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5762606 + ... + 5942552.
It is an arithmetic number, because the mean of its divisors is an integer number (67340140560).
Almost surely, 21053154033313 is an apocalyptic number.
It is an amenable number.
1053154033313 is a deficient number, since it is larger than the sum of its proper divisors (24288215647).
1053154033313 is a wasteful number, since it uses less digits than its factorization.
1053154033313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 180796.
The product of its (nonzero) digits is 24300, while the sum is 32.
Adding to 1053154033313 its reverse (3133304513501), we get a palindrome (4186458546814).
The spelling of 1053154033313 in words is "one trillion, fifty-three billion, one hundred fifty-four million, thirty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •