Base | Representation |
---|---|
bin | 110000111100010001… |
… | …0001101101100110010 |
3 | 101001021200220212002120 |
4 | 1201320202031230302 |
5 | 3210221432400114 |
6 | 120141040455110 |
7 | 10410340404450 |
oct | 1417042155462 |
9 | 331250825076 |
10 | 105101450034 |
11 | 40634035009 |
12 | 1845231a496 |
13 | 9bac69bb29 |
14 | 51307ad9d0 |
15 | 2b020305a9 |
hex | 187888db32 |
105101450034 has 16 divisors (see below), whose sum is σ = 240231885888. Its totient is φ = 30028985712.
The previous prime is 105101450011. The next prime is 105101450087. The reversal of 105101450034 is 430054101501.
It is a happy number.
It is a super-2 number, since 2×1051014500342 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105101449986 and 105101450013.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1251207697 + ... + 1251207780.
It is an arithmetic number, because the mean of its divisors is an integer number (15014492868).
Almost surely, 2105101450034 is an apocalyptic number.
105101450034 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
105101450034 is an abundant number, since it is smaller than the sum of its proper divisors (135130435854).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105101450034 is a wasteful number, since it uses less digits than its factorization.
105101450034 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2502415489.
The product of its (nonzero) digits is 1200, while the sum is 24.
Adding to 105101450034 its reverse (430054101501), we get a palindrome (535155551535).
The spelling of 105101450034 in words is "one hundred five billion, one hundred one million, four hundred fifty thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •