Base | Representation |
---|---|
bin | 10011000110101010001000… |
… | …10111011000101010101101 |
3 | 12111202010201121110111201212 |
4 | 21203111010113120222231 |
5 | 21001243413324300323 |
6 | 225203121332244205 |
7 | 11564065316020010 |
oct | 1143250427305255 |
9 | 174663647414655 |
10 | 42010222103213 |
11 | 1242748719a341 |
12 | 4865a42470665 |
13 | 1a59715842100 |
14 | a5343c7c5377 |
15 | 4ccbb032ab78 |
hex | 2635445d8aad |
42010222103213 has 96 divisors (see below), whose sum is σ = 54230487736320. Its totient is φ = 31840682065920.
The previous prime is 42010222103203. The next prime is 42010222103221. The reversal of 42010222103213 is 31230122201024.
It is not a de Polignac number, because 42010222103213 - 24 = 42010222103197 is a prime.
It is a super-2 number, since 2×420102221032132 (a number of 28 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42010222103203) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 597473303 + ... + 597543611.
It is an arithmetic number, because the mean of its divisors is an integer number (564900913920).
Almost surely, 242010222103213 is an apocalyptic number.
It is an amenable number.
42010222103213 is a deficient number, since it is larger than the sum of its proper divisors (12220265633107).
42010222103213 is a wasteful number, since it uses less digits than its factorization.
42010222103213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 70607 (or 70594 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 42010222103213 its reverse (31230122201024), we get a palindrome (73240344304237).
The spelling of 42010222103213 in words is "forty-two trillion, ten billion, two hundred twenty-two million, one hundred three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •