Base | Representation |
---|---|
bin | 11101011011001100011… |
… | …01011001100110000100 |
3 | 10120122122120021100011120 |
4 | 32231212031121212010 |
5 | 113031043204301200 |
6 | 2052243422433540 |
7 | 133021214040342 |
oct | 16554615314604 |
9 | 3518576240146 |
10 | 1011032103300 |
11 | 35a85a2a043a |
12 | 143b407328b0 |
13 | 74455a5360b |
14 | 36d116b2992 |
15 | 1b4750479a0 |
hex | eb66359984 |
1011032103300 has 36 divisors (see below), whose sum is σ = 2925252886416. Its totient is φ = 269608560800.
The previous prime is 1011032103299. The next prime is 1011032103329. The reversal of 1011032103300 is 33012301101.
1011032103300 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 1011032103300.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1685053206 + ... + 1685053805.
Almost surely, 21011032103300 is an apocalyptic number.
1011032103300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1011032103300 is an abundant number, since it is smaller than the sum of its proper divisors (1914220783116).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1011032103300 is a wasteful number, since it uses less digits than its factorization.
1011032103300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3370107028 (or 3370107021 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 1011032103300 its reverse (33012301101), we get a palindrome (1044044404401).
The spelling of 1011032103300 in words is "one trillion, eleven billion, thirty-two million, one hundred three thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •