Base | Representation |
---|---|
bin | 100011010010111010001111… |
… | …011011000100101111001010 |
3 | 202100121221122020211100000121 |
4 | 203102322033123010233022 |
5 | 130321301310222014320 |
6 | 1310052104525053454 |
7 | 44461035502221304 |
oct | 4322721733045712 |
9 | 670557566740017 |
10 | 155231114251210 |
11 | 45509167145418 |
12 | 154b09b60b728a |
13 | 688030111497a |
14 | 2a4932429a974 |
15 | 12e2db694c8aa |
hex | 8d2e8f6c4bca |
155231114251210 has 8 divisors (see below), whose sum is σ = 279416005652196. Its totient is φ = 62092445700480.
The previous prime is 155231114251189. The next prime is 155231114251223. The reversal of 155231114251210 is 12152411132551.
155231114251210 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 141963912649321 + 13267201601889 = 11914861^2 + 3642417^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7761555712551 + ... + 7761555712570.
Almost surely, 2155231114251210 is an apocalyptic number.
155231114251210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
155231114251210 is a deficient number, since it is larger than the sum of its proper divisors (124184891400986).
155231114251210 is a wasteful number, since it uses less digits than its factorization.
155231114251210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15523111425128.
The product of its (nonzero) digits is 12000, while the sum is 34.
Adding to 155231114251210 its reverse (12152411132551), we get a palindrome (167383525383761).
The spelling of 155231114251210 in words is "one hundred fifty-five trillion, two hundred thirty-one billion, one hundred fourteen million, two hundred fifty-one thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •