Base | Representation |
---|---|
bin | 11110000100011111001… |
… | …01011101011110111100 |
3 | 10122202212120011201101122 |
4 | 33002033211131132330 |
5 | 113411443441104040 |
6 | 2110351313330112 |
7 | 134434454361626 |
oct | 17021745353674 |
9 | 3582776151348 |
10 | 1033201113020 |
11 | 3691a610257a |
12 | 1482a8b66938 |
13 | 765798cbc4b |
14 | 38015a89c16 |
15 | 1bd2140d1b5 |
hex | f08f95d7bc |
1033201113020 has 24 divisors (see below), whose sum is σ = 2297353063824. Its totient is φ = 388969830656.
The previous prime is 1033201113017. The next prime is 1033201113041. The reversal of 1033201113020 is 203111023301.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a self number, because there is not a number n which added to its sum of digits gives 1033201113020.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1519413062 + ... + 1519413741.
It is an arithmetic number, because the mean of its divisors is an integer number (95723044326).
Almost surely, 21033201113020 is an apocalyptic number.
1033201113020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1033201113020 is an abundant number, since it is smaller than the sum of its proper divisors (1264151950804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1033201113020 is a wasteful number, since it uses less digits than its factorization.
1033201113020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3038826829 (or 3038826827 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 1033201113020 its reverse (203111023301), we get a palindrome (1236312136321).
The spelling of 1033201113020 in words is "one trillion, thirty-three billion, two hundred one million, one hundred thirteen thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •