Base | Representation |
---|---|
bin | 100000000100011010001101… |
… | …110011011111110001111111 |
3 | 200111101100020000001222200022 |
4 | 200010122031303133301333 |
5 | 121441301433334344043 |
6 | 1215545041305522355 |
7 | 41464561306123553 |
oct | 4004321563376177 |
9 | 614340200058608 |
10 | 141040515153023 |
11 | 40a37a45981282 |
12 | 1399a71b1a33bb |
13 | 60910a96baa65 |
14 | 26b857c4bd863 |
15 | 1148bc2a97868 |
hex | 80468dcdfc7f |
141040515153023 has 4 divisors (see below), whose sum is σ = 147172711464048. Its totient is φ = 134908318842000.
The previous prime is 141040515152939. The next prime is 141040515153071. The reversal of 141040515153023 is 320351515040141.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 141040515153023 - 210 = 141040515151999 is a prime.
It is a super-2 number, since 2×1410405151530232 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141040515153323) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3066098155478 + ... + 3066098155523.
It is an arithmetic number, because the mean of its divisors is an integer number (36793177866012).
Almost surely, 2141040515153023 is an apocalyptic number.
141040515153023 is a deficient number, since it is larger than the sum of its proper divisors (6132196311025).
141040515153023 is an equidigital number, since it uses as much as digits as its factorization.
141040515153023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6132196311024.
The product of its (nonzero) digits is 36000, while the sum is 35.
The spelling of 141040515153023 in words is "one hundred forty-one trillion, forty billion, five hundred fifteen million, one hundred fifty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •