Base | Representation |
---|---|
bin | 10011010010010011… |
… | …10011000001011000 |
3 | 222201121002022111000 |
4 | 21221021303001120 |
5 | 132201123014202 |
6 | 4431232305000 |
7 | 514404326142 |
oct | 115111630130 |
9 | 28647068430 |
10 | 10354110552 |
11 | 4433697565 |
12 | 200b6a2160 |
13 | c90182646 |
14 | 7031bdc92 |
15 | 40900991c |
hex | 269273058 |
10354110552 has 64 divisors (see below), whose sum is σ = 28787097600. Its totient is φ = 3448288800.
The previous prime is 10354110523. The next prime is 10354110601. The reversal of 10354110552 is 25501145301.
10354110552 is a `hidden beast` number, since 10 + 3 + 541 + 105 + 5 + 2 = 666.
It is a super-3 number, since 3×103541105523 (a number of 31 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
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, 227793 + ... + 269439.
It is an arithmetic number, because the mean of its divisors is an integer number (449798400).
Almost surely, 210354110552 is an apocalyptic number.
10354110552 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10354110552 is an abundant number, since it is smaller than the sum of its proper divisors (18432987048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10354110552 is a wasteful number, since it uses less digits than its factorization.
10354110552 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42813 (or 42803 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 27.
Adding to 10354110552 its reverse (25501145301), we get a palindrome (35855255853).
The spelling of 10354110552 in words is "ten billion, three hundred fifty-four million, one hundred ten thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •