Base | Representation |
---|---|
bin | 11101011110111010111… |
… | …10111111000110110110 |
3 | 10120211211000200200200000 |
4 | 32233131132333012312 |
5 | 113044142444431402 |
6 | 2053214145132130 |
7 | 133121623066545 |
oct | 16573536770666 |
9 | 3524730620600 |
10 | 1013033202102 |
11 | 3606969185a9 |
12 | 1443ba92a046 |
13 | 746b44c3b4c |
14 | 3706137615c |
15 | 1b540a75c1c |
hex | ebdd7bf1b6 |
1013033202102 has 48 divisors (see below), whose sum is σ = 2277130931712. Its totient is φ = 337539341160.
The previous prime is 1013033202101. The next prime is 1013033202143. The reversal of 1013033202102 is 2012023303101.
1013033202102 is a `hidden beast` number, since 1 + 0 + 130 + 3 + 320 + 210 + 2 = 666.
It is a super-2 number, since 2×10130332021022 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1013033202101) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 763327 + ... + 1615157.
It is an arithmetic number, because the mean of its divisors is an integer number (47440227744).
Almost surely, 21013033202102 is an apocalyptic number.
1013033202102 is an abundant number, since it is smaller than the sum of its proper divisors (1264097729610).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1013033202102 is an equidigital number, since it uses as much as digits as its factorization.
1013033202102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 854295 (or 854283 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 1013033202102 its reverse (2012023303101), we get a palindrome (3025056505203).
The spelling of 1013033202102 in words is "one trillion, thirteen billion, thirty-three million, two hundred two thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •