Base | Representation |
---|---|
bin | 10111001100110001111011… |
… | …010100101011101001011010 |
3 | 111101021021210221202112210110 |
4 | 113030301323110223221122 |
5 | 101333203210344244002 |
6 | 1001001242333425150 |
7 | 30330443406640200 |
oct | 2714617324535132 |
9 | 441237727675713 |
10 | 102033312103002 |
11 | 2a5690a2751aa5 |
12 | b53a8a593b1b6 |
13 | 44c1914001567 |
14 | 1b2a61d957070 |
15 | bbe1c2069e6c |
hex | 5ccc7b52ba5a |
102033312103002 has 48 divisors (see below), whose sum is σ = 237445236788832. Its totient is φ = 29144808413280.
The previous prime is 102033312102893. The next prime is 102033312103013. The reversal of 102033312103002 is 200301213330201.
It is a super-2 number, since 2×1020333121030022 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 102033312103002.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 43903824 + ... + 46169387.
It is an arithmetic number, because the mean of its divisors is an integer number (4946775766434).
Almost surely, 2102033312103002 is an apocalyptic number.
102033312103002 is an abundant number, since it is smaller than the sum of its proper divisors (135411924685830).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102033312103002 is a wasteful number, since it uses less digits than its factorization.
102033312103002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 90077083 (or 90077076 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 102033312103002 its reverse (200301213330201), we get a palindrome (302334525433203).
The spelling of 102033312103002 in words is "one hundred two trillion, thirty-three billion, three hundred twelve million, one hundred three thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •