Base | Representation |
---|---|
bin | 1001010111000010110110… |
… | …1000111110100010111000 |
3 | 1100102212011211202100201202 |
4 | 2111300231220332202320 |
5 | 2322104001340423010 |
6 | 33515504143233332 |
7 | 2111352101116250 |
oct | 225605550764270 |
9 | 40385154670652 |
10 | 10291507357880 |
11 | 3308670671621 |
12 | 11a2690ba8848 |
13 | 59863c666cb8 |
14 | 27817c3a8960 |
15 | 12ca8bc436a5 |
hex | 95c2da3e8b8 |
10291507357880 has 64 divisors (see below), whose sum is σ = 26473654103040. Its totient is φ = 3527213069952.
The previous prime is 10291507357861. The next prime is 10291507357933. The reversal of 10291507357880 is 8875370519201.
10291507357880 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 (56).
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, 6030992 + ... + 7546911.
It is an arithmetic number, because the mean of its divisors is an integer number (413650845360).
Almost surely, 210291507357880 is an apocalyptic number.
10291507357880 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10291507357880 is an abundant number, since it is smaller than the sum of its proper divisors (16182146745160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10291507357880 is a wasteful number, since it uses less digits than its factorization.
10291507357880 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13580628 (or 13580624 counting only the distinct ones).
The product of its (nonzero) digits is 4233600, while the sum is 56.
The spelling of 10291507357880 in words is "ten trillion, two hundred ninety-one billion, five hundred seven million, three hundred fifty-seven thousand, eight hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •