Base | Representation |
---|---|
bin | 11110000110100011111… |
… | …11001100001010000101 |
3 | 10122212202012102212101122 |
4 | 33003101333030022011 |
5 | 113421234134412203 |
6 | 2111054031203325 |
7 | 134504202514646 |
oct | 17032177141205 |
9 | 3585665385348 |
10 | 1034315154053 |
11 | 369717a38045 |
12 | 14855a076545 |
13 | 766c665791c |
14 | 380bda016cd |
15 | 1bd89119538 |
hex | f0d1fcc285 |
1034315154053 has 8 divisors (see below), whose sum is σ = 1090988435520. Its totient is φ = 977865436800.
The previous prime is 1034315154043. The next prime is 1034315154077. The reversal of 1034315154053 is 3504515134301.
1034315154053 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1034315154053 - 232 = 1030020186757 is a prime.
It is a super-2 number, since 2×10343151540532 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1034315154043) 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, 55881548 + ... + 55900053.
It is an arithmetic number, because the mean of its divisors is an integer number (136373554440).
Almost surely, 21034315154053 is an apocalyptic number.
It is an amenable number.
1034315154053 is a deficient number, since it is larger than the sum of its proper divisors (56673281467).
1034315154053 is a wasteful number, since it uses less digits than its factorization.
1034315154053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 111782107.
The product of its (nonzero) digits is 54000, while the sum is 35.
The spelling of 1034315154053 in words is "one trillion, thirty-four billion, three hundred fifteen million, one hundred fifty-four thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •