Base | Representation |
---|---|
bin | 1001111111110011… |
… | …01001000011111100 |
3 | 111212001000222221110 |
4 | 10333321221003330 |
5 | 41442430323200 |
6 | 2244322202020 |
7 | 250000051434 |
oct | 47771510374 |
9 | 14761028843 |
10 | 5367042300 |
11 | 2304612354 |
12 | 10594b3310 |
13 | 676c00b99 |
14 | 38cb272c4 |
15 | 2162a9b50 |
hex | 13fe690fc |
5367042300 has 144 divisors (see below), whose sum is σ = 15850534112. Its totient is φ = 1401753600.
The previous prime is 5367042293. The next prime is 5367042319. The reversal of 5367042300 is 32407635.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 5727432 + ... + 5728368.
Almost surely, 25367042300 is an apocalyptic number.
5367042300 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5367042300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7925267056).
5367042300 is an abundant number, since it is smaller than the sum of its proper divisors (10483491812).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5367042300 is a wasteful number, since it uses less digits than its factorization.
5367042300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1328 (or 1321 counting only the distinct ones).
The product of its (nonzero) digits is 15120, while the sum is 30.
The square root of 5367042300 is about 73260.1003275316. The cubic root of 5367042300 is about 1750.8341383988.
Adding to 5367042300 its reverse (32407635), we get a palindrome (5399449935).
The spelling of 5367042300 in words is "five billion, three hundred sixty-seven million, forty-two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •