Base | Representation |
---|---|
bin | 110011001000001111… |
… | …1010000111110100110 |
3 | 101111102000212102120111 |
4 | 1212100133100332212 |
5 | 3244331331010020 |
6 | 122235102323234 |
7 | 10634622062356 |
oct | 1462037207646 |
9 | 344360772514 |
10 | 109798297510 |
11 | 42624305040 |
12 | 1934328951a |
13 | a47a797a15 |
14 | 54584bab66 |
15 | 2cc9553d5a |
hex | 19907d0fa6 |
109798297510 has 64 divisors (see below), whose sum is σ = 223118556480. Its totient is φ = 38536046080.
The previous prime is 109798297439. The next prime is 109798297559. The reversal of 109798297510 is 15792897901.
It is a super-2 number, since 2×1097982975102 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (58).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 13563024 + ... + 13571116.
It is an arithmetic number, because the mean of its divisors is an integer number (3486227445).
Almost surely, 2109798297510 is an apocalyptic number.
109798297510 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
109798297510 is an abundant number, since it is smaller than the sum of its proper divisors (113320258970).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109798297510 is a wasteful number, since it uses less digits than its factorization.
109798297510 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12393.
The product of its (nonzero) digits is 2857680, while the sum is 58.
Subtracting from 109798297510 its reverse (15792897901), we obtain a square (94005399609 = 3066032).
The spelling of 109798297510 in words is "one hundred nine billion, seven hundred ninety-eight million, two hundred ninety-seven thousand, five hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •