Base | Representation |
---|---|
bin | 11000001000001001011101… |
… | …010111110100100000001110 |
3 | 111220201022021101222212000002 |
4 | 120020021131113310200032 |
5 | 102402023440301243210 |
6 | 1013403352523404302 |
7 | 31231261524326012 |
oct | 3010113527644016 |
9 | 456638241885002 |
10 | 106113028540430 |
11 | 308a1312282a0a |
12 | ba994ba683692 |
13 | 472955326a9a2 |
14 | 1c2bc800da542 |
15 | c4039b6804a5 |
hex | 60825d5f480e |
106113028540430 has 32 divisors (see below), whose sum is σ = 207989239255200. Its totient is φ = 38824657990272.
The previous prime is 106113028540391. The next prime is 106113028540469. The reversal of 106113028540430 is 34045820311601.
It is an interprime number because it is at equal distance from previous prime (106113028540391) and next prime (106113028540469).
It is a super-2 number, since 2×1061130285404302 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (38).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9629125937 + ... + 9629136956.
It is an arithmetic number, because the mean of its divisors is an integer number (6499663726725).
Almost surely, 2106113028540430 is an apocalyptic number.
106113028540430 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
106113028540430 is a deficient number, since it is larger than the sum of its proper divisors (101876210714770).
106113028540430 is a wasteful number, since it uses less digits than its factorization.
106113028540430 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19258262948.
The product of its (nonzero) digits is 69120, while the sum is 38.
The spelling of 106113028540430 in words is "one hundred six trillion, one hundred thirteen billion, twenty-eight million, five hundred forty thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •