Base | Representation |
---|---|
bin | 1000001111101100000… |
… | …1100110011110100011 |
3 | 111112121212022122121020 |
4 | 2003323001212132203 |
5 | 4310100004020220 |
6 | 145023500500523 |
7 | 13143141665550 |
oct | 2037301463643 |
9 | 445555278536 |
10 | 141650454435 |
11 | 55089a96a76 |
12 | 2355254a743 |
13 | 104857b1c59 |
14 | 6bda8d7a27 |
15 | 3a40a8a040 |
hex | 20fb0667a3 |
141650454435 has 32 divisors (see below), whose sum is σ = 259980917760. Its totient is φ = 64513757568.
The previous prime is 141650454401. The next prime is 141650454437. The reversal of 141650454435 is 534454056141.
141650454435 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 141650454435 - 27 = 141650454307 is a prime.
It is a super-2 number, since 2×1416504544352 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (141650454437) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 2479287 + ... + 2535776.
It is an arithmetic number, because the mean of its divisors is an integer number (8124403680).
Almost surely, 2141650454435 is an apocalyptic number.
141650454435 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
141650454435 is a deficient number, since it is larger than the sum of its proper divisors (118330463325).
141650454435 is a wasteful number, since it uses less digits than its factorization.
141650454435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5015347.
The product of its (nonzero) digits is 576000, while the sum is 42.
The spelling of 141650454435 in words is "one hundred forty-one billion, six hundred fifty million, four hundred fifty-four thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •