Base | Representation |
---|---|
bin | 101101111111000001101… |
… | …1111110101001111100100 |
3 | 211101012021211220110000110 |
4 | 1123332003133311033210 |
5 | 1312022032340133020 |
6 | 21235225410213020 |
7 | 1221420021364404 |
oct | 133760337651744 |
9 | 24335254813013 |
10 | 6320103052260 |
11 | 2017382454428 |
12 | 860a65884170 |
13 | 36aca20081aa |
14 | 17bc74ba0804 |
15 | ae60146b8e0 |
hex | 5bf837f53e4 |
6320103052260 has 48 divisors (see below), whose sum is σ = 18737246699136. Its totient is φ = 1586221942272.
The previous prime is 6320103052189. The next prime is 6320103052273. The reversal of 6320103052260 is 622503010236.
It is a super-2 number, since 2×63201030522602 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
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, 3098088712 + ... + 3098090751.
It is an arithmetic number, because the mean of its divisors is an integer number (390359306232).
Almost surely, 26320103052260 is an apocalyptic number.
6320103052260 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
6320103052260 is an abundant number, since it is smaller than the sum of its proper divisors (12417143646876).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6320103052260 is a wasteful number, since it uses less digits than its factorization.
6320103052260 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6196179492 (or 6196179490 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 30.
Adding to 6320103052260 its reverse (622503010236), we get a palindrome (6942606062496).
The spelling of 6320103052260 in words is "six trillion, three hundred twenty billion, one hundred three million, fifty-two thousand, two hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •