Base | Representation |
---|---|
bin | 10110111111011001110000… |
… | …000111101110010010110110 |
3 | 111021000101220121000200022011 |
4 | 112333121300013232102312 |
5 | 101223122433243432004 |
6 | 555015044133354434 |
7 | 30204150131546353 |
oct | 2677316007562266 |
9 | 437011817020264 |
10 | 101114001155254 |
11 | 2a24423068535a |
12 | b4106a2498a1a |
13 | 4456017845b69 |
14 | 1ad7d2d9b362a |
15 | ba5319531004 |
hex | 5bf6701ee4b6 |
101114001155254 has 8 divisors (see below), whose sum is σ = 151673289544368. Its totient is φ = 50556237973800.
The previous prime is 101114001155243. The next prime is 101114001155257. The reversal of 101114001155254 is 452551100411101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1011140011552542 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101114001155257) 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, 381136162 + ... + 381401365.
It is an arithmetic number, because the mean of its divisors is an integer number (18959161193046).
Almost surely, 2101114001155254 is an apocalyptic number.
101114001155254 is a deficient number, since it is larger than the sum of its proper divisors (50559288389114).
101114001155254 is an equidigital number, since it uses as much as digits as its factorization.
101114001155254 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 762603830.
The product of its (nonzero) digits is 4000, while the sum is 31.
Adding to 101114001155254 its reverse (452551100411101), we get a palindrome (553665101566355).
The spelling of 101114001155254 in words is "one hundred one trillion, one hundred fourteen billion, one million, one hundred fifty-five thousand, two hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •