Base | Representation |
---|---|
bin | 10110100100100000110… |
… | …010100001101111111000 |
3 | 12111021111011210220110120 |
4 | 112210200302201233320 |
5 | 200403004011411300 |
6 | 3144311310413240 |
7 | 220026023415333 |
oct | 26444062415770 |
9 | 5437434726416 |
10 | 1551033310200 |
11 | 548875960710 |
12 | 210725b01220 |
13 | b335328708a |
14 | 550db2d961a |
15 | 2a52c8003a0 |
hex | 16920ca1bf8 |
1551033310200 has 96 divisors (see below), whose sum is σ = 5245312671360. Its totient is φ = 376008073600.
The previous prime is 1551033310199. The next prime is 1551033310213. The reversal of 1551033310200 is 20133301551.
It is a Harshad number since it is a multiple of its sum of digits (24).
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 23 ways as a sum of consecutive naturals, for example, 117495924 + ... + 117509123.
It is an arithmetic number, because the mean of its divisors is an integer number (54638673660).
Almost surely, 21551033310200 is an apocalyptic number.
1551033310200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1551033310200 is an abundant number, since it is smaller than the sum of its proper divisors (3694279361160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1551033310200 is a wasteful number, since it uses less digits than its factorization.
1551033310200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 235005077 (or 235005068 counting only the distinct ones).
The product of its (nonzero) digits is 1350, while the sum is 24.
Adding to 1551033310200 its reverse (20133301551), we get a palindrome (1571166611751).
The spelling of 1551033310200 in words is "one trillion, five hundred fifty-one billion, thirty-three million, three hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •