Base | Representation |
---|---|
bin | 100011010010101010010101… |
… | …101110110010001111100011 |
3 | 202100120022120100000022000201 |
4 | 203102222111232302033203 |
5 | 130321011323243244301 |
6 | 1310040202401130031 |
7 | 44456562416252533 |
oct | 4322522556621743 |
9 | 670508510008021 |
10 | 155214040212451 |
11 | 455019a5307390 |
12 | 154a9630029917 |
13 | 687b80c99a65c |
14 | 2a485848274c3 |
15 | 12e27179ed201 |
hex | 8d2a95bb23e3 |
155214040212451 has 16 divisors (see below), whose sum is σ = 170304951938400. Its totient is φ = 140286569713920.
The previous prime is 155214040212431. The next prime is 155214040212467. The reversal of 155214040212451 is 154212040412551.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 155214040212451 - 29 = 155214040211939 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 155214040212451.
It is not an unprimeable number, because it can be changed into a prime (155214040212421) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 206955631 + ... + 207704263.
It is an arithmetic number, because the mean of its divisors is an integer number (10644059496150).
Almost surely, 2155214040212451 is an apocalyptic number.
155214040212451 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
155214040212451 is a deficient number, since it is larger than the sum of its proper divisors (15090911725949).
155214040212451 is a wasteful number, since it uses less digits than its factorization.
155214040212451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 857766.
The product of its (nonzero) digits is 64000, while the sum is 37.
The spelling of 155214040212451 in words is "one hundred fifty-five trillion, two hundred fourteen billion, forty million, two hundred twelve thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •