Base | Representation |
---|---|
bin | 1001010010111000111000… |
… | …0001101101011111010000 |
3 | 1100012000220001001022100211 |
4 | 2110232032001231133100 |
5 | 2314421241130312240 |
6 | 33423015334253504 |
7 | 2103243565512100 |
oct | 224561601553720 |
9 | 40160801038324 |
10 | 10220110010320 |
11 | 3290362732661 |
12 | 11908861b7294 |
13 | 5919a188c292 |
14 | 274927d71200 |
15 | 12acadb13bea |
hex | 94b8e06d7d0 |
10220110010320 has 60 divisors (see below), whose sum is σ = 27641226115044. Its totient is φ = 3504037716480.
The previous prime is 10220110010251. The next prime is 10220110010333. The reversal of 10220110010320 is 2301001102201.
It can be written as a sum of positive squares in 2 ways, for example, as 6995686444096 + 3224423566224 = 2644936^2 + 1795668^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 10220110010320.
It is a congruent number.
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, 1303581541 + ... + 1303589380.
Almost surely, 210220110010320 is an apocalyptic number.
10220110010320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10220110010320 is an abundant number, since it is smaller than the sum of its proper divisors (17421116104724).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10220110010320 is a wasteful number, since it uses less digits than its factorization.
10220110010320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2607170948 (or 2607170935 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 10220110010320 its reverse (2301001102201), we get a palindrome (12521111112521).
The spelling of 10220110010320 in words is "ten trillion, two hundred twenty billion, one hundred ten million, ten thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •