Base | Representation |
---|---|
bin | 1000001110111111110… |
… | …0010010111011001010 |
3 | 111112010220102220121201 |
4 | 2003233330102323022 |
5 | 4304204403424000 |
6 | 144553215254414 |
7 | 13135423350103 |
oct | 2035774227312 |
9 | 445126386551 |
10 | 141464514250 |
11 | 54aa40373a4 |
12 | 2350021a40a |
13 | 1045610b387 |
14 | 6bbdd353aa |
15 | 3a2e5ab96a |
hex | 20eff12eca |
141464514250 has 64 divisors (see below), whose sum is σ = 286293945600. Its totient is φ = 52158686400.
The previous prime is 141464514211. The next prime is 141464514253. The reversal of 141464514250 is 52415464141.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is not an unprimeable number, because it can be changed into a prime (141464514253) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 226710 + ... + 578209.
It is an arithmetic number, because the mean of its divisors is an integer number (4473342900).
Almost surely, 2141464514250 is an apocalyptic number.
141464514250 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
141464514250 is an abundant number, since it is smaller than the sum of its proper divisors (144829431350).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141464514250 is a wasteful number, since it uses less digits than its factorization.
141464514250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 804992 (or 804982 counting only the distinct ones).
The product of its (nonzero) digits is 76800, while the sum is 37.
Adding to 141464514250 its reverse (52415464141), we get a palindrome (193879978391).
It can be divided in two parts, 1414645 and 14250, that added together give a triangular number (1428895 = T1690).
The spelling of 141464514250 in words is "one hundred forty-one billion, four hundred sixty-four million, five hundred fourteen thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •