Base | Representation |
---|---|
bin | 10111011011010100000111… |
… | …110010000101010000111110 |
3 | 111111210202212021100020120210 |
4 | 113123110013302011100332 |
5 | 102001034220331024042 |
6 | 1003044143242453250 |
7 | 30462552340524030 |
oct | 2733240762052076 |
9 | 444722767306523 |
10 | 103032101033022 |
11 | 2a913739aa0107 |
12 | b68038a204226 |
13 | 4564b683cb035 |
14 | 1b62acd1cbc50 |
15 | bda17c30aa9c |
hex | 5db507c8543e |
103032101033022 has 32 divisors (see below), whose sum is σ = 235548131616000. Its totient is φ = 29431969852608.
The previous prime is 103032101033011. The next prime is 103032101033047. The reversal of 103032101033022 is 220330101230301.
It is a super-2 number, since 2×1030321010330222 (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 103032101033022.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 240337447 + ... + 240765762.
It is an arithmetic number, because the mean of its divisors is an integer number (7360879113000).
Almost surely, 2103032101033022 is an apocalyptic number.
103032101033022 is an abundant number, since it is smaller than the sum of its proper divisors (132516030582978).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103032101033022 is a wasteful number, since it uses less digits than its factorization.
103032101033022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 481108320.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 103032101033022 its reverse (220330101230301), we get a palindrome (323362202263323).
The spelling of 103032101033022 in words is "one hundred three trillion, thirty-two billion, one hundred one million, thirty-three thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •