Base | Representation |
---|---|
bin | 11001100101010000000110… |
… | …10000111001011011110010 |
3 | 21101011222101001112010222010 |
4 | 30302220003100321123302 |
5 | 24333142314304413320 |
6 | 315351234152223350 |
7 | 14564220430504233 |
oct | 1462500320713362 |
9 | 241158331463863 |
10 | 56255536404210 |
11 | 16a199257a3160 |
12 | 638684939ab56 |
13 | 2550b49b60580 |
14 | dc6ad521b08a |
15 | 6785079c2ae0 |
hex | 332a034396f2 |
56255536404210 has 128 divisors (see below), whose sum is σ = 162305777120256. Its totient is φ = 12295892125440.
The previous prime is 56255536404209. The next prime is 56255536404217. The reversal of 56255536404210 is 1240463555265.
It is a super-2 number, since 2×562555364042102 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 56255536404210.
It is not an unprimeable number, because it can be changed into a prime (56255536404217) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 152294352 + ... + 152663291.
It is an arithmetic number, because the mean of its divisors is an integer number (1268013883752).
Almost surely, 256255536404210 is an apocalyptic number.
56255536404210 is an abundant number, since it is smaller than the sum of its proper divisors (106050240716046).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56255536404210 is a wasteful number, since it uses less digits than its factorization.
56255536404210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 304957720.
The product of its (nonzero) digits is 4320000, while the sum is 48.
Adding to 56255536404210 its reverse (1240463555265), we get a palindrome (57495999959475).
The spelling of 56255536404210 in words is "fifty-six trillion, two hundred fifty-five billion, five hundred thirty-six million, four hundred four thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •