Base | Representation |
---|---|
bin | 100011001111101111010101… |
… | …110001010000111100011000 |
3 | 202022212010021222221122112120 |
4 | 203033233111301100330120 |
5 | 130304214114243011100 |
6 | 1305404034322341240 |
7 | 44436223604311041 |
oct | 4317572561207430 |
9 | 668763258848476 |
10 | 155013251141400 |
11 | 4543482909a453 |
12 | 154767341ba820 |
13 | 68658c1053c42 |
14 | 2a3c977a238c8 |
15 | 12dc3b51600a0 |
hex | 8cfbd5c50f18 |
155013251141400 has 96 divisors (see below), whose sum is σ = 481085294314560. Its totient is φ = 41290052711040.
The previous prime is 155013251141387. The next prime is 155013251141431. The reversal of 155013251141400 is 4141152310551.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 145764322 + ... + 146823921.
It is an arithmetic number, because the mean of its divisors is an integer number (5011305149110).
Almost surely, 2155013251141400 is an apocalyptic number.
155013251141400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
155013251141400 is an abundant number, since it is smaller than the sum of its proper divisors (326072043173160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
155013251141400 is a wasteful number, since it uses less digits than its factorization.
155013251141400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 292589145 (or 292589136 counting only the distinct ones).
The product of its (nonzero) digits is 12000, while the sum is 33.
The spelling of 155013251141400 in words is "one hundred fifty-five trillion, thirteen billion, two hundred fifty-one million, one hundred forty-one thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •