Base | Representation |
---|---|
bin | 1001000110110110100001… |
… | …1101011011011100010110 |
3 | 1022110021010120122000112010 |
4 | 2101231220131123130112 |
5 | 2303024240223441042 |
6 | 33144020055005050 |
7 | 2052303302543550 |
oct | 221555035333426 |
9 | 38407116560463 |
10 | 10013321312022 |
11 | 32106979199a6 |
12 | 1158795069786 |
13 | 578337c7a682 |
14 | 26890c4184d0 |
15 | 1257096b359c |
hex | 91b6875b716 |
10013321312022 has 16 divisors (see below), whose sum is σ = 22887591570432. Its totient is φ = 2860948946280.
The previous prime is 10013321312017. The next prime is 10013321312051. The reversal of 10013321312022 is 22021312331001.
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 10013321312022.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 119206206054 + ... + 119206206137.
It is an arithmetic number, because the mean of its divisors is an integer number (1430474473152).
Almost surely, 210013321312022 is an apocalyptic number.
10013321312022 is an abundant number, since it is smaller than the sum of its proper divisors (12874270258410).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10013321312022 is a wasteful number, since it uses less digits than its factorization.
10013321312022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 238412412203.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 10013321312022 its reverse (22021312331001), we get a palindrome (32034633643023).
The spelling of 10013321312022 in words is "ten trillion, thirteen billion, three hundred twenty-one million, three hundred twelve thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •